default search action
Anushka Anand
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [c9]Kanit Wongsuphasawat, Zening Qu, Dominik Moritz, Riley Chang, Felix Ouk
, Anushka Anand, Jock D. Mackinlay, Bill Howe, Jeffrey Heer:
Voyager 2: Augmenting Visual Analysis with Partial View Specifications. CHI 2017: 2648-2659 - 2016
- [j7]Kanit Wongsuphasawat, Dominik Moritz, Anushka Anand, Jock D. Mackinlay, Bill Howe
Voyager: Exploratory Analysis via Faceted Browsing of Visualization Recommendations. IEEE Trans. Vis. Comput. Graph. 22(1): 649-658 (2016) - [j6]Anushka Anand, Justin Talbot:
Automatic Selection of Partitioning Variables for Small Multiple Displays. IEEE Trans. Vis. Comput. Graph. 22(1): 669-677 (2016) - [c8]Kanit Wongsuphasawat, Dominik Moritz, Anushka Anand, Jock D. Mackinlay, Bill Howe
Towards a general-purpose query language for visualization recommendation. HILDA@SIGMOD 2016: 4 - 2014
- [j5]Justin Talbot, Vidya Setlur, Anushka Anand:
Four Experiments on the Perception of Bar Charts. IEEE Trans. Vis. Comput. Graph. 20(12): 2152-2160 (2014) - 2013
- [j4]Dang Tuan Nhon
TimeSeer: Scagnostics for High-Dimensional Time Series. IEEE Trans. Vis. Comput. Graph. 19(3): 470-483 (2013) - 2012
- [j3]Leland Wilkinson, Anushka Anand, Dang Tuan Nhon
Substantial improvements in the set-covering projection classifier CHIRP (composite hypercubes on iterated random projections). ACM Trans. Knowl. Discov. Data 6(4): 19:1-19:18 (2012) - [c7]Anushka Anand, Leland Wilkinson, Dang Tuan Nhon
Visual pattern discovery using random projections. IEEE VAST 2012: 43-52 - [c6]Dang Tuan Nhon
FmFinder: Search and Filter Your Favorite Songs. ISVC (1) 2012: 348-358 - 2011
- [c5]Anushka Anand, Leland Wilkinson, Dang Tuan Nhon:
Using random projections to identify class-separating variables in high-dimensional spaces. IEEE VAST 2011: 263-264 - [c4]Leland Wilkinson, Anushka Anand, Dang Tuan Nhon
CHIRP: a new classifier based on composite hypercubes on iterated random projections. KDD 2011: 6-14 - 2010
- [j2]Dang Tuan Nhon
Stacking Graphic Elements to Avoid Over-Plotting. IEEE Trans. Vis. Comput. Graph. 16(6): 1044-1052 (2010)
2000 – 2009
- 2009
- [c3]Anushka Anand, Leland Wilkinson, Dang Tuan Nhon
An L-infinity Norm Visual Classifier. ICDM 2009: 687-692 - 2008
- [p1]Robert L. Grossman, Michal Sabala, Yunhong Gu, Anushka Anand, Matt Handley, Rajmonda Sulo Caceres
Discovering Emergent Behavior from Network Packet Data. Next Generation of Data Mining 2008 - 2006
- [j1]Leland Wilkinson, Anushka Anand, Robert L. Grossman:
High-Dimensional Visual Analytics: Interactive Exploration Guided by Pairwise Views of Point Distributions. IEEE Trans. Vis. Comput. Graph. 12(6): 1363-1372 (2006) - 2005
- [c2]Leland Wilkinson, Anushka Anand, Robert L. Grossman:
Graph-Theoretic Scagnostics. INFOVIS 2005: 157-164 - [c1]Robert L. Grossman, Michal Sabala, Anushka Anand, Steve Eick, Leland Wilkinson, Pei Zhang, John Chaves, Steve Vejcik, John F. Dillenburg, Peter C. Nelson, Doug Rorem, Javid Alimohideen, Jason Leigh, Michael E. Papka
Real Time Change Detection and Alerts from Highway Traffic Data. SC 2005: 69
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: