Sciweavers

284 search results - page 57 / 57
» What Matchings Can Be Stable
Sort
View
UIST
2010
ACM
13 years 3 months ago
VizWiz: nearly real-time answers to visual questions
Visual information pervades our environment. Vision is used to de cide everything from what we want to eat at a restaurant and which bus route to take to whether our clothes match...
Jeffrey P. Bigham, Chandrika Jayant, Hanjie Ji, Gr...
EJC
2009
13 years 3 months ago
From Word Form Surfaces to Communication
The starting point of this paper is the external surface of a word form, for example the agent-external acoustic perturbations constituting a language sign in speech or the dots o...
Roland Hausser
ICDE
2009
IEEE
157views Database» more  ICDE 2009»
13 years 3 months ago
Query Rewrites with Views for XML in DB2
There is much effort to develop comprehensive support for the storage and querying of XML data in database management systems. The major developers have extended their systems to h...
Parke Godfrey, Jarek Gryz, Andrzej Hoppe, Wenbin M...
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
13 years 10 months ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen