Sciweavers

14897 search results - page 2519 / 2980
» Environment for statistical computing
Sort
View
AOSD
2010
ACM
15 years 12 months ago
Tracking code patterns over multiple software versions with Herodotos
An important element of understanding a software code base is to identify the repetitive patterns of code it contains and how these evolve over time. Some patterns are useful to t...
Nicolas Palix, Julia L. Lawall, Gilles Muller
EDBT
2010
ACM
177views Database» more  EDBT 2010»
15 years 12 months ago
Bridging the gap between intensional and extensional query evaluation in probabilistic databases
There are two broad approaches to query evaluation over probabilistic databases: (1) Intensional Methods proceed by manipulating expressions over symbolic events associated with u...
Abhay Jha, Dan Olteanu, Dan Suciu
IPSN
2010
Springer
15 years 12 months ago
Online distributed sensor selection
A key problem in sensor networks is to decide which sensors to query when, in order to obtain the most useful information (e.g., for performing accurate prediction), subject to co...
Daniel Golovin, Matthew Faulkner, Andreas Krause
212
Voted
WSDM
2009
ACM
198views Data Mining» more  WSDM 2009»
15 years 12 months ago
Measuring the similarity between implicit semantic relations using web search engines
Measuring the similarity between implicit semantic relations is an important task in information retrieval and natural language processing. For example, consider the situation whe...
Danushka Bollegala, Yutaka Matsuo, Mitsuru Ishizuk...
WSDM
2009
ACM
187views Data Mining» more  WSDM 2009»
15 years 12 months ago
Speeding up algorithms on compressed web graphs
A variety of lossless compression schemes have been proposed to reduce the storage requirements of web graphs. One successful approach is virtual node compression [7], in which of...
Chinmay Karande, Kumar Chellapilla, Reid Andersen
« Prev « First page 2519 / 2980 Last » Next »