Sciweavers

2107 search results - page 393 / 422
» Computing Small Search Numbers in Linear Time
Sort
View
PLDI
2010
ACM
14 years 6 months ago
Breadcrumbs: Efficient Context Sensitivity for Dynamic Bug Detection Analyses
Calling context--the set of active methods on the stack--is critical for understanding the dynamic behavior of large programs. Dynamic program analysis tools, however, are almost ...
Michael D. Bond, Graham Z. Baker, Samuel Z. Guyer
CIKM
2009
Springer
14 years 3 months ago
Fast shortest path distance estimation in large networks
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
Michalis Potamias, Francesco Bonchi, Carlos Castil...
ICDM
2006
IEEE
131views Data Mining» more  ICDM 2006»
14 years 2 months ago
Intelligent Icons: Integrating Lite-Weight Data Mining and Visualization into GUI Operating Systems
The vast majority of visualization tools introduced so far are specialized pieces of software that are explicitly run on a particular dataset at a particular time for a particular...
Eamonn J. Keogh, Li Wei, Xiaopeng Xi, Stefano Lona...
SIGIR
2003
ACM
14 years 2 months ago
Automatic image annotation and retrieval using cross-media relevance models
Libraries have traditionally used manual image annotation for indexing and then later retrieving their image collections. However, manual image annotation is an expensive and labo...
Jiwoon Jeon, Victor Lavrenko, R. Manmatha
CORR
2010
Springer
107views Education» more  CORR 2010»
13 years 7 months ago
Yacc is dead
Abstract. We present two novel approaches to parsing context-free languages. The first approach is based on an extension of Brzozowski’s derivative from regular expressions to c...
Matthew Might, David Darais