Sciweavers

2088 search results - page 270 / 418
» The Probabilistic Method
Sort
View
IJRR
2006
145views more  IJRR 2006»
15 years 3 months ago
Coordinate-free Coverage in Sensor Networks with Controlled Boundaries via Homology
ABSTRACT. We introduce tools from computational homology to verify coverage in an idealized sensor network. Our methods are unique in that, while they are coordinate-free and assum...
V. de Silva, R. Ghrist
DEBU
2007
109views more  DEBU 2007»
15 years 3 months ago
Managing Uncertainty in Social Networks
Social network analysis (SNA) has become a mature scientific field over the last 50 years and is now an area with massive commercial appeal and renewed research interest. In thi...
Eytan Adar, Christopher Re
PAMI
2006
138views more  PAMI 2006»
15 years 3 months ago
Context-Based Segmentation of Image Sequences
We describe an algorithm for context-based segmentation of visual data. New frames in an image sequence (video) are segmented based on the prior segmentation of earlier frames in ...
Jacob Goldberger, Hayit Greenspan
TCAD
2008
133views more  TCAD 2008»
15 years 3 months ago
Metal-Density-Driven Placement for CMP Variation and Routability
In this paper, we propose the first metal-density driven placement algorithm to reduce CMP variation and achieve higher routability. Based on an analytical placement framework, we...
Tung-Chieh Chen, Minsik Cho, David Z. Pan, Yao-Wen...
DCG
2000
76views more  DCG 2000»
15 years 2 months ago
A Central Limit Theorem for Convex Chains in the Square
Points P1, . . . , Pn in the unit square define a convex n-chain if they are below y = x and, together with P0 = (0, 0) and Pn+1 = (1, 1), they are in convex position. Under unifo...
Imre Bárány, Günter Rote, Willi...