Sciweavers

5128 search results - page 19 / 1026
» When Abstraction Fails
Sort
View
ICDT
2005
ACM
88views Database» more  ICDT 2005»
14 years 28 days ago
When Is Nearest Neighbors Indexable?
Abstract. In this paper, we consider whether traditional index structures are effective in processing unstable nearest neighbors workloads. It is known that under broad conditions...
Uri Shaft, Raghu Ramakrishnan
EMSOFT
2001
Springer
13 years 12 months ago
Some Synchronization Issues When Designing Embedded Systems from Components
Abstract This paper is sort of a confession. Issues of synchrony, asynchrony, and synchronization, arise frequently in designing embedded systems from components, like everyone I k...
Albert Benveniste
ICDCS
2010
IEEE
13 years 11 months ago
When Transportation Meets Communication: V2P over VANETs
Abstract—Information interaction is a crucial part of modern transportation activities. In this paper, we propose the idea of Vehicle-to-Passenger communication (V2P), which allo...
Nianbo Liu, Ming Liu, Jiannong Cao, Guihai Chen, W...
ECAI
2010
Springer
13 years 8 months ago
Learning When to Use Lazy Learning in Constraint Solving
Abstract. Learning in the context of constraint solving is a technique by which previously unknown constraints are uncovered during search and used to speed up subsequent search. R...
Ian P. Gent, Christopher Jefferson, Lars Kotthoff,...
CORR
2010
Springer
94views Education» more  CORR 2010»
13 years 6 months ago
When LP is the Cure for Your Matching Woes: Improved Bounds for Stochastic Matchings
Abstract Consider a random graph model where each possible edge e is present independently with some probability pe. Given these probabilities, we want to build a large/heavy match...
Nikhil Bansal, Anupam Gupta, Jian Li, Juliá...