Sciweavers

10051 search results - page 1345 / 2011
» A Dynamic Separator Algorithm
Sort
View
OSDI
2008
ACM
16 years 7 months ago
From Optimization to Regret Minimization and Back Again
Internet routing is mostly based on static information-it's dynamicity is limited to reacting to changes in topology. Adaptive performance-based routing decisions would not o...
Ioannis C. Avramopoulos, Jennifer Rexford, Robert ...
SIGMOD
2007
ACM
134views Database» more  SIGMOD 2007»
16 years 7 months ago
Updating a cracked database
A cracked database is a datastore continuously reorganized based on operations being executed. For each query, the data of interest is physically reclustered to speed-up future ac...
Stratos Idreos, Martin L. Kersten, Stefan Manegold
PERCOM
2007
ACM
16 years 6 months ago
Buddy tracking - efficient proximity detection among mobile friends
: Global positioning systems (GPS) and mobile phone networks are making it possible to track individual users with an increasing accuracy. It is natural to ask whether one can use ...
Arnon Amir, Alon Efrat, Jussi Myllymaki, Lingeshwa...
PERCOM
2003
ACM
16 years 6 months ago
Self-Routing in Pervasive Computing Environments Using Smart Messages
Smart Messages (SMs) are dynamic collections of code and data that migrate to nodes of interest in the network and execute on these nodes. A key challenge in programming pervasive...
Cristian Borcea, Chalermek Intanagonwiwat, Akhiles...
STACS
2010
Springer
16 years 2 months ago
Planar Subgraph Isomorphism Revisited
Abstract. The problem of Subgraph Isomorphism is defined as follows: Given a pattern H and a host graph G on n vertices, does G contain a subgraph that is isomorphic to H? Eppstei...
Frederic Dorn
« Prev « First page 1345 / 2011 Last » Next »