Sciweavers

1957 search results - page 239 / 392
» Approximate algorithms for neural-Bayesian approaches
Sort
View
STOC
2002
ACM
149views Algorithms» more  STOC 2002»
16 years 6 months ago
The complexity of choosing an H-colouring (nearly) uniformly at random
Cooper, Dyer and Frieze studied the problem of sampling H-colourings (nearly) uniformly at random. Special cases of this problem include sampling colourings and independent sets a...
Leslie Ann Goldberg, Steven Kelk, Mike Paterson
ICCD
2001
IEEE
119views Hardware» more  ICCD 2001»
16 years 2 months ago
A Functional Validation Technique: Biased-Random Simulation Guided by Observability-Based Coverage
We present a simulation-based semi-formal verification method for sequential circuits described at the registertransfer level. The method consists of an iterative loop where cove...
Serdar Tasiran, Farzan Fallah, David G. Chinnery, ...
IROS
2008
IEEE
180views Robotics» more  IROS 2008»
16 years 12 days ago
Aligning point cloud views using persistent feature histograms
— In this paper we investigate the usage of persistent point feature histograms for the problem of aligning point cloud data views into a consistent global model. Given a collect...
Radu Bogdan Rusu, Nico Blodow, Zoltan Csaba Marton...
GLOBECOM
2007
IEEE
16 years 9 days ago
Clustered K-Center: Effective Replica Placement in Peer-to-Peer Systems
Abstract— Peer-to-Peer (P2P) systems provide decentralization, self-organization, scalability and failure-resilience, but suffer from high worst-case latencies. Researchers have ...
Jian Zhou, Xin Zhang, Laxmi N. Bhuyan, Bin Liu
SRDS
2006
IEEE
15 years 12 months ago
Reducing the Availability Management Overheads of Federated Content Sharing Systems
We consider the problem of ensuring high data availability in federated content sharing systems. Ideally, such a system would provide high data availability in a device transparen...
Christopher Peery, Thu D. Nguyen, Francisco Matias...