Sciweavers

90 search results - page 13 / 18
» ccr 2006
Sort
View
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
14 years 2 months ago
The computational complexity of nash equilibria in concisely represented games
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...
Grant Schoenebeck, Salil P. Vadhan
CAV
2006
Springer
101views Hardware» more  CAV 2006»
14 years 8 days ago
Ticc: A Tool for Interface Compatibility and Composition
Abstract. We present a brief overview of the tool Ticc (Tool for Interface Compatibility and Composition). In Ticc, a component interface describes both the behavior of a component...
B. Thomas Adler, Luca de Alfaro, Leandro Dias da S...
CVPR
2006
IEEE
14 years 10 months ago
Graph Partitioning by Spectral Rounding: Applications in Image Segmentation and Clustering
ct We introduce a new family of spectral partitioning methods. Edge separators of a graph are produced by iteratively reweighting the edges until the graph disconnects into the pre...
David Tolliver, Gary L. Miller
ICDM
2006
IEEE
161views Data Mining» more  ICDM 2006»
14 years 2 months ago
STAGGER: Periodicity Mining of Data Streams Using Expanding Sliding Windows
Sensor devices are becoming ubiquitous, especially in measurement and monitoring applications. Because of the real-time, append-only and semi-infinite natures of the generated se...
Mohamed G. Elfeky, Walid G. Aref, Ahmed K. Elmagar...
STOC
2006
ACM
244views Algorithms» more  STOC 2006»
14 years 8 months ago
Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform
We introduce a new low-distortion embedding of d 2 into O(log n) p (p = 1, 2), called the Fast-Johnson-LindenstraussTransform. The FJLT is faster than standard random projections ...
Nir Ailon, Bernard Chazelle