Sciweavers

2254 search results - page 361 / 451
» Computing the minimal covering set
Sort
View
191
Voted
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
15 years 11 months ago
Equilibria in topology control games for ad hoc networks
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...
Stephan Eidenbenz, V. S. Anil Kumar, Sibylle Zust
SIGMOD
2010
ACM
186views Database» more  SIGMOD 2010»
15 years 10 months ago
Fast approximate correlation for massive time-series data
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
Abdullah Mueen, Suman Nath, Jie Liu
CONEXT
2007
ACM
15 years 9 months ago
Fair and efficient scheduling in data ferrying networks
Data-ferrying disconnection-tolerant networks allow remote rural areas to access the Internet at very low cost, making them viable alternatives to more expensive access technologi...
Shimin Guo, Srinivasan Keshav
TOG
2002
212views more  TOG 2002»
15 years 5 months ago
Least squares conformal maps for automatic texture atlas generation
A Texture Atlas is an efficient color representation for 3D Paint Systems. The model to be textured is decomposed into charts homeomorphic to discs, each chart is parameterized, a...
Bruno Lévy, Sylvain Petitjean, Nicolas Ray,...
DIS
2010
Springer
15 years 4 months ago
Discovery of Conservation Laws via Matrix Search
Abstract. One of the main goals of Discovery Science is the development and analysis of methods for automatic knowledge discovery in the natural sciences. A central area of natural...
Oliver Schulte, Mark S. Drew