Sciweavers

10055 search results - page 1972 / 2011
» Structured programming using processes
Sort
View
WSDM
2012
ACM
207views Data Mining» more  WSDM 2012»
12 years 4 months ago
Sequence clustering and labeling for unsupervised query intent discovery
One popular form of semantic search observed in several modern search engines is to recognize query patterns that trigger instant answers or domain-specific search, producing sem...
Jackie Chi Kit Cheung, Xiao Li
MOBIHOC
2012
ACM
11 years 11 months ago
Serendipity: enabling remote computing among intermittently connected mobile devices
Mobile devices are increasingly being relied on for services that go beyond simple connectivity and require more complex processing. Fortunately, a mobile device encounters, possi...
Cong Shi, Vasileios Lakafosis, Mostafa H. Ammar, E...
STOC
2012
ACM
256views Algorithms» more  STOC 2012»
11 years 11 months ago
Competitive contagion in networks
We develop a game-theoretic framework for the study of competition between firms who have budgets to “seed” the initial adoption of their products by consumers located in a s...
Sanjeev Goyal, Michael Kearns
ICDT
2012
ACM
251views Database» more  ICDT 2012»
11 years 11 months ago
Computing universal models under guarded TGDs
A universal model of a database D and a set Σ of integrity constraints is a database that extends D, satisfies Σ, and is most general in the sense that it contains sound and co...
André Hernich
CN
2004
148views more  CN 2004»
13 years 8 months ago
Multiway range trees: scalable IP lookup with fast updates
In this paper, we introduce a new IP lookup scheme with worst-case search and update time of O(log n), where n is the number of prefixes in the forwarding table. Our scheme is base...
Priyank Ramesh Warkhede, Subhash Suri, George Varg...
« Prev « First page 1972 / 2011 Last » Next »