Sciweavers

5210 search results - page 886 / 1042
» Exact geometric computation
Sort
View
ISAAC
2010
Springer
291views Algorithms» more  ISAAC 2010»
13 years 8 months ago
A Tighter Analysis of Work Stealing
Abstract. Classical list scheduling is a very popular and efficient technique for scheduling jobs in parallel platforms. However, with the increasing number of processors, the cost...
Marc Tchiboukdjian, Nicolas Gast, Denis Trystram, ...
RTAS
2010
IEEE
13 years 8 months ago
An Efficient Algorithm for Real-Time Divisible Load Scheduling
Providing QoS and performance guarantees to arbitrarily divisible loads has become a significant problem for many cluster-based research computing facilities. While progress is be...
Anwar Mamat, Ying Lu, Jitender S. Deogun, Steve Go...
SIGSOFT
2010
ACM
13 years 8 months ago
Realizability analysis for message-based interactions using shared-state projections
The global interaction behavior in message-based systems can be specified as a finite-state machine defining acceptable sequences of messages exchanged by a group of peers. Realiz...
Sylvain Hallé, Tevfik Bultan
ICMCS
2009
IEEE
205views Multimedia» more  ICMCS 2009»
13 years 7 months ago
Bregman vantage point trees for efficient nearest Neighbor Queries
Nearest Neighbor (NN) retrieval is a crucial tool of many computer vision tasks. Since the brute-force naive search is too time consuming for most applications, several tailored d...
Frank Nielsen, Paolo Piro, Michel Barlaud
ASIACRYPT
2010
Springer
13 years 7 months ago
The Round Complexity of Verifiable Secret Sharing: The Statistical Case
We consider the round complexity of a basic cryptographic task: verifiable secret sharing (VSS). This well-studied primitive provides a good "test case" for our understan...
Ranjit Kumaresan, Arpita Patra, C. Pandu Rangan