Sciweavers

7351 search results - page 1448 / 1471
» Segmenting Point Sets
Sort
View
IOR
2008
91views more  IOR 2008»
13 years 7 months ago
A Randomized Quasi-Monte Carlo Simulation Method for Markov Chains
We introduce and study a randomized quasi-Monte Carlo method for estimating the state distribution at each step of a Markov chain. The number of steps in the chain can be random an...
Pierre L'Ecuyer, Christian Lécot, Bruno Tuf...
CORR
2007
Springer
92views Education» more  CORR 2007»
13 years 7 months ago
Throughput Scaling in Random Wireless Networks: A Non-Hierarchical Multipath Routing Strategy
— Franceschetti et al. [1] have recently shown that per-node throughput in an extended (i.e., geographically expanding), ad hoc wireless network with Θ(n) randomly distributed n...
Awlok Josan, Mingyan Liu, David L. Neuhoff, S. San...
ISCA
2006
IEEE
144views Hardware» more  ISCA 2006»
13 years 7 months ago
Conditional Memory Ordering
Conventional relaxed memory ordering techniques follow a proactive model: at a synchronization point, a processor makes its own updates to memory available to other processors by ...
Christoph von Praun, Harold W. Cain, Jong-Deok Cho...
CORR
2007
Springer
117views Education» more  CORR 2007»
13 years 7 months ago
An annotation based approach to support design communication
The aim of this paper is to propose an approach based on the concept of annotation for supporting design communication. In this paper, we describe a co-operative design case study...
Onur Hisarciklilar, Jean-François Boujut
CORR
2007
Springer
167views Education» more  CORR 2007»
13 years 7 months ago
Approximation Algorithms for Orienteering with Time Windows
Orienteering is the following optimization problem: given an edge-weighted graph (directed or undirected), two nodes s, t and a time limit T, find an s-t walk of total length at ...
Chandra Chekuri, Nitish Korula
« Prev « First page 1448 / 1471 Last » Next »