Sciweavers

315 search results - page 59 / 63
» Simple Distributed Weighted Matchings
Sort
View
BMCBI
2006
137views more  BMCBI 2006»
13 years 7 months ago
Bounded search for de novo identification of degenerate cis-regulatory elements
Background: The identification of statistically overrepresented sequences in the upstream regions of coregulated genes should theoretically permit the identification of potential ...
Jonathan M. Carlson, Arijit Chakravarty, Radhika S...
IJCV
2006
165views more  IJCV 2006»
13 years 7 months ago
A Riemannian Framework for Tensor Computing
Tensors are nowadays a common source of geometric information. In this paper, we propose to endow the tensor space with an affine-invariant Riemannian metric. We demonstrate that ...
Xavier Pennec, Pierre Fillard, Nicholas Ayache
JIIS
2006
113views more  JIIS 2006»
13 years 7 months ago
Spatial ordering and encoding for geographic data mining and visualization
: Geographic information (e.g., locations, networks, and nearest neighbors) are unique and different from other aspatial attributes (e.g., population, sales, or income). It is a ch...
Diansheng Guo, Mark Gahegan
STOC
2010
ACM
228views Algorithms» more  STOC 2010»
14 years 14 days ago
On the searchability of small-world networks with arbitrary underlying structure
Revisiting the “small-world” experiments of the ’60s, Kleinberg observed that individuals are very effective at constructing short chains of acquaintances between any two p...
Pierre Fraigniaud and George Giakkoupis
SPAA
2004
ACM
14 years 1 months ago
Adaptive channel queue routing on k-ary n-cubes
This paper introduces a new adaptive method, Channel Queue Routing (CQR), for load-balanced routing on k-ary n-cube interconnection networks. CQR estimates global congestion in th...
Arjun Singh, William J. Dally, Amit K. Gupta, Bria...