Sciweavers

7930 search results - page 461 / 1586
» Greedy in Approximation Algorithms
Sort
View
COMPGEOM
2003
ACM
16 years 5 days ago
Billboard clouds
We introduce billboard clouds – a new approach for extreme simplification in the context of real-time rendering. 3D models are simplified onto a set of planes with texture and...
Xavier Décoret, Frédo Durand, Fran&c...
EDBT
2009
ACM
117views Database» more  EDBT 2009»
15 years 10 months ago
Parsimonious temporal aggregation
Temporal aggregation is a crucial operator in temporal databases and has been studied in various flavors. In instant temporal aggregation (ITA) the aggregate value at time instan...
Juozas Gordevicius, Johann Gamper, Michael H. B&ou...
UAI
2003
15 years 8 months ago
Learning Generative Models of Similarity Matrices
Recently, spectral clustering (a.k.a. normalized graph cut) techniques have become popular for their potential ability at finding irregularlyshaped clusters in data. The input to...
Rómer Rosales, Brendan J. Frey
TCSV
2008
105views more  TCSV 2008»
15 years 6 months ago
Combination Load Balancing for Video-on-Demand Systems
We observe that an effect of "disk resource sharing" of multi-copy movie traffic has great impact on the blocking performance of a video-on-demand system. This observatio...
Jun Guo, Eric Wing Ming Wong, Sammy Chan, Peter Ta...
INFOCOM
2010
IEEE
15 years 5 months ago
Making the Case for Random Access Scheduling in Wireless Multi-hop Networks
—This paper formally establishes that random access scheduling schemes, and, more specifically CSMA-CA, yields exceptionally good performance in the context of wireless multihop...
Apoorva Jindal, Ann Arbor, Konstantinos Psounis