Sciweavers

300 search results - page 6 / 60
» Vertex Cover: Further Observations and Further Improvements
Sort
View
FOCS
2004
IEEE
13 years 11 months ago
Stochastic Optimization is (Almost) as easy as Deterministic Optimization
Stochastic optimization problems attempt to model uncertainty in the data by assuming that (part of) the input is specified in terms of a probability distribution. We consider the...
David B. Shmoys, Chaitanya Swamy
PERCOM
2009
ACM
14 years 2 months ago
Delaunay-Triangulation Based Complete Coverage in Wireless Sensor Networks
—One of the major issues in a wireless sensor network (WSN) is how to cover an interested area. In this paper, we consider the area coverage problem for variable sensing radii WS...
Chinh T. Vu, Yingshu Li
CORR
2008
Springer
143views Education» more  CORR 2008»
13 years 7 months ago
Locally computable approximations for spectral clustering and absorption times of random walks
We address the problem of determining a natural local neighbourhood or "cluster" associated to a given seed vertex in an undirected graph. We formulate the task in terms...
Pekka Orponen, Satu Elisa Schaeffer, Vanesa Avalos...
JCP
2008
87views more  JCP 2008»
13 years 7 months ago
Real-Time Systems - Biologically Inspired Future
- In this paper, we are presenting a bionic approach towards real-time systems research. Observing that a cell is both real-time computing and real-time manufacturing system, the w...
Nevena Ackovska, Stevo Bozinovski, Gjorgi Jovancev...
IFIP12
2007
13 years 8 months ago
Clustering Improves the Exploration of Graph Mining Results
Mining frequent subgraphs is an area of research where we have a given set of graphs, and where we search for (connected) subgraphs contained in many of these graphs. Each graph ca...
Edgar H. de Graaf, Joost N. Kok, Walter A. Kosters