Sciweavers

2372 search results - page 216 / 475
» Probabilistic calling context
Sort
View
ADHOC
2007
144views more  ADHOC 2007»
15 years 4 months ago
Adaptive gossip protocols: Managing security and redundancy in dense ad hoc networks
Abstract. Many ad hoc routing algorithms rely on broadcast flooding for location discovery or, more generally, for secure routing applications. Flooding is a robust algorithm but ...
Mike Burmester, Tri Van Le, Alec Yasinsac
119
Voted
BMCBI
2010
82views more  BMCBI 2010»
15 years 4 months ago
Genome-wide estimation of firing efficiencies of origins of DNA replication from time-course copy number variation data
Background: DNA replication is a fundamental biological process during S phase of cell division. It is initiated from several hundreds of origins along whole chromosome with diffe...
Huaien Luo, Juntao Li, Majid Eshaghi, Jianhua Liu,...
136
Voted
SIAMCOMP
1998
125views more  SIAMCOMP 1998»
15 years 3 months ago
Free Bits, PCPs, and Nonapproximability-Towards Tight Results
This paper continues the investigation of the connection between probabilistically checkable proofs (PCPs) and the approximability of NP-optimization problems. The emphasis is on p...
Mihir Bellare, Oded Goldreich, Madhu Sudan
144
Voted
CVPR
2007
IEEE
16 years 6 months ago
Mapping Natural Image Patches by Explicit and Implicit Manifolds
Image patches are fundamental elements for object modeling and recognition. However, there has not been a panoramic study of the structures of the whole ensemble of natural image ...
Kent Shi, Song Chun Zhu
ICDE
2007
IEEE
173views Database» more  ICDE 2007»
16 years 5 months ago
Accelerating Profile Queries in Elevation Maps
Elevation maps are a widely used spatial data representation in geographical information systems (GIS). Paths on elevation maps can be characterized by profiles, which describe re...
Feng Pan, Wei Wang 0010, Leonard McMillan