Sciweavers

3708 search results - page 549 / 742
» Approximating Betweenness Centrality
Sort
View
ALGORITHMICA
2000
161views more  ALGORITHMICA 2000»
15 years 6 months ago
Binary Searching with Nonuniform Costs and Its Application to Text Retrieval
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
Gonzalo Navarro, Ricardo A. Baeza-Yates, Eduardo F...
IJNS
2000
130views more  IJNS 2000»
15 years 6 months ago
A Programmable VLSI Filter Architecture for Application in Real-Time Vision Processing Systems
An architecture is proposed for the realization of real-time edge-extraction filtering operation in an Address-Event-Representation (AER) vision system. Furthermore, the approach ...
Teresa Serrano-Gotarredona, Andreas G. Andreou, Be...
CORR
2007
Springer
217views Education» more  CORR 2007»
15 years 6 months ago
Hard constraint satisfaction problems have hard gaps at location 1
An instance of the maximum constraint satisfaction problem (Max CSP) is a nite collection of constraints on a set of variables, and the goal is to assign values to the variables ...
Peter Jonsson, Andrei A. Krokhin, Fredrik Kuivinen
BC
1998
96views more  BC 1998»
15 years 6 months ago
Evidence of phase transitions in heart period dynamics
Complexity measures of non-linear dynamics are a useful tool for quantifying observed stretching, folding, scaling and mixing processes in the Takens-reconstructed state space of h...
Henrik Bettermann, Peter Van Leeuwen
COMPUTER
1999
69views more  COMPUTER 1999»
15 years 6 months ago
Scientific Components Are Coming
abstract mathematical or physical statement, not something specific. The way scientific programmers most frequently verify that their programs are correct is to examine their resul...
Paul F. Dubois