Sciweavers

8512 search results - page 1303 / 1703
» Computing Theory With Relevance
Sort
View
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
16 years 24 days ago
Lower bounds for predecessor searching in the cell probe model
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
Pranab Sen
STOC
2009
ACM
144views Algorithms» more  STOC 2009»
16 years 8 months ago
Homology flows, cohomology cuts
We describe the first algorithm to compute maximum flows in surface-embedded graphs in near-linear time. Specifically, given a graph embedded on a surface of genus g, with two spe...
Erin W. Chambers, Jeff Erickson, Amir Nayyeri
CCGRID
2005
IEEE
16 years 1 months ago
Evaluating high-throughput reliable multicast for grid applications in production networks
Grid computing can be characterized as a distributed infrastructure that is a collection of computing resources within or across locations that are aggregated to act as a unified ...
Marinho P. Barcellos, Maziar Nekovee, M. Koyabe, M...
VISUALIZATION
2005
IEEE
16 years 1 months ago
Topology-driven Surface Mappings with Robust Feature Alignment
Topological concepts and techniques have been broadly applied in computer graphics and geometric modeling. However, the homotopy type of a mapping between two surfaces has not bee...
Christopher Carner, Miao Jin, Xianfeng Gu, Hong Qi...
MCU
2004
126views Hardware» more  MCU 2004»
15 years 9 months ago
Universality and Cellular Automata
The classification of discrete dynamical systems that are computationally complete has recently drawn attention in light of Wolfram's "Principle of Computational Equivale...
Klaus Sutner
« Prev « First page 1303 / 1703 Last » Next »