Sciweavers

4679 search results - page 907 / 936
» Modeling When Connections Are the Problem
Sort
View
ICDE
2009
IEEE
170views Database» more  ICDE 2009»
15 years 11 months ago
Semantics of Ranking Queries for Probabilistic Data and Expected Ranks
Abstract-- When dealing with massive quantities of data, topk queries are a powerful technique for returning only the k most relevant tuples for inspection, based on a scoring func...
Graham Cormode, Feifei Li, Ke Yi
ICIP
2002
IEEE
15 years 11 months ago
A method for color naming and description of color composition in images
Color is one of the main visual cues and has been frequently used in image processing, analysis and retrieval. The extraction of highlevel color descriptors is an increasingly imp...
Aleksandra Mojsilovic
POPL
2009
ACM
15 years 10 months ago
The theory of deadlock avoidance via discrete control
Deadlock in multithreaded programs is an increasingly important problem as ubiquitous multicore architectures force parallelization upon an ever wider range of software. This pape...
Manjunath Kudlur, Scott A. Mahlke, Stéphane...
CHI
2009
ACM
15 years 10 months ago
Adaptive pointing: implicit gain adaptation for absolute pointing devices
Werner A. K?nig HCI-Group, University of Konstanz Box-D73, Universit?t Konstanz 78457 Konstanz, Germany werner.koenig@uni-konstanz.de Jens Gerken HCI-Group, University of Konstanz ...
Harald Reiterer, Jens Gerken, Stefan Dierdorf, Wer...
SPAA
2009
ACM
15 years 10 months ago
On randomized representations of graphs using short labels
Informative labeling schemes consist in labeling the nodes of graphs so that queries regarding any two nodes (e.g., are the two nodes adjacent?) can be answered by inspecting mere...
Pierre Fraigniaud, Amos Korman