Sciweavers

402 search results - page 65 / 81
» A branch and cut algorithm for the Steiner problem in graphs
Sort
View
IPSN
2005
Springer
14 years 25 days ago
Estimation in sensor networks: a graph approach
Abstract—In many sensor networks applications, sensors collect correlated measurements of a physical field, e.g., temperature field in a building or in a data center. However, ...
Haotian Zhang, José M. F. Moura, Bruce H. K...
PARELEC
2002
IEEE
14 years 7 days ago
Techniques for Optimization of Net Algorithms
In this paper, techniques for optimization of net algorithms describing parallel asynchronous computations and derived from cycling and branching behavioral descriptions are prese...
Anatoly Prihozhy, Daniel Mlynek, Michail Solomenni...
CVPR
2001
IEEE
14 years 9 months ago
Understanding Popout through Repulsion
Perceptual popout is defined by both feature similarity and local feature contrast. We identify these two measures with attraction and repulsion, and unify the dual processes of a...
Stella X. Yu, Jianbo Shi
KDD
2004
ACM
109views Data Mining» more  KDD 2004»
14 years 7 months ago
Identifying early buyers from purchase data
Market research has shown that consumers exhibit a variety of different purchasing behaviors; specifically, some tend to purchase products earlier than other consumers. Identifyin...
Paat Rusmevichientong, Shenghuo Zhu, David Selinge...
ESA
2007
Springer
176views Algorithms» more  ESA 2007»
14 years 1 months ago
Arrangements in Geometry: Recent Advances and Challenges
We review recent progress in the study of arrangements in computational and combinatorial geometry, and discuss several open problems and areas for further research. In this talk I...
Micha Sharir