Sciweavers

328 search results - page 48 / 66
» Simple Termination Revisited
Sort
View
PG
2003
IEEE
14 years 25 days ago
Breaking the Walls: Scene Partitioning and Portal Creation
In this paper we revisit the cells-and-portals visibility methods, originally developed for the special case of architectural interiors. We define an effectiveness measure for a ...
Alon Lerner, Yiorgos Chrysanthou, Daniel Cohen-Or
SENSYS
2003
ACM
14 years 24 days ago
On the scaling laws of dense wireless sensor networks
We consider dense wireless sensor networks deployed to observe arbitrary random fields. The requirement is to reconstruct an estimate of the random field at a certain collector ...
Praveen Kumar Gopala, Hesham El Gamal
STOC
2010
ACM
228views Algorithms» more  STOC 2010»
14 years 12 days ago
On the searchability of small-world networks with arbitrary underlying structure
Revisiting the “small-world” experiments of the ’60s, Kleinberg observed that individuals are very effective at constructing short chains of acquaintances between any two p...
Pierre Fraigniaud and George Giakkoupis
DAC
1994
ACM
13 years 11 months ago
Optimum Functional Decomposition Using Encoding
In this paper, we revisit the classical problem of functional decomposition [1, 2] that arises so often in logic synthesis. One basic problem that has remained largely unaddressed...
Rajeev Murgai, Robert K. Brayton, Alberto L. Sangi...
CLEF
2008
Springer
13 years 9 months ago
Back to Basics - Again - for Domain-Specific Retrieval
In this paper we will describe Berkeley's approach to the Domain Specific (DS) track for CLEF 2008. Last year we used Entry Vocabulary Indexes and Thesaurus expansion approac...
Ray R. Larson