Sciweavers

1291 search results - page 39 / 259
» Computing the multiplicity structure in solving polynomial s...
Sort
View
ICIP
1999
IEEE
14 years 9 months ago
Quadtrees for Embedded Surface Visualization: Constraints and Efficient Data Structures
The quadtree data structure is widely used in digital image processing and computer graphics for modeling spatial segmentation of images and surfaces. A quadtree is a tree in whic...
Laurent Balmelli, Jelena Kovacevic, Martin Vetterl...
COCO
2009
Springer
117views Algorithms» more  COCO 2009»
14 years 2 months ago
The Proof Complexity of Polynomial Identities
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
Pavel Hrubes, Iddo Tzameret
SIGCOMM
2006
ACM
14 years 1 months ago
Jigsaw: solving the puzzle of enterprise 802.11 analysis
The combination of unlicensed spectrum, cheap wireless interfaces and the inherent convenience of untethered computing have made 802.11-based networks ubiquitous in the enterprise...
Yu-Chung Cheng, John Bellardo, Péter Benk&o...
CDC
2008
IEEE
117views Control Systems» more  CDC 2008»
14 years 2 months ago
Simulation-aided reachability and local gain analysis for nonlinear dynamical systems
Abstract— We analyze reachability properties and local input/output gains of systems with polynomial vector fields. Upper bounds for the reachable set and nonlinear system gains...
Weehong Tan, Ufuk Topcu, Peter Seiler, Gary J. Bal...
WEA
2010
Springer
284views Algorithms» more  WEA 2010»
14 years 2 months ago
Paging Multiple Users in Cellular Network: Yellow Page and Conference Call Problems
Abstract. Mobile users are roaming in a zone of cells in a cellular network system. The probabilities of each user residing in each cell are known, and all probabilities are indepe...
Amotz Bar-Noy, Panagiotis Cheilaris, Yi Feng 0002