Sciweavers

322 search results - page 48 / 65
» Algorithms for Large Integer Matrix Problems
Sort
View
MSN
2007
Springer
125views Sensor Networks» more  MSN 2007»
14 years 1 months ago
Ensuring Area Coverage in Hybrid Wireless Sensor Networks
Success of Wireless Sensor Networks largely depends whether the deployed network can provide desired coverage with acceptable network lifetime. This paper proposes a distributed pr...
Nadeem Ahmed, Salil S. Kanhere, Sanjay Jha
ASPDAC
2006
ACM
134views Hardware» more  ASPDAC 2006»
14 years 1 months ago
Constraint driven I/O planning and placement for chip-package co-design
System-on-chip and system-in-package result in increased number of I/O cells and complicated constraints for both chip designs and package designs. This renders the traditional ma...
Jinjun Xiong, Yiu-Chung Wong, Egino Sarto, Lei He
CANDC
2004
ACM
13 years 7 months ago
Identification of related gene/protein names based on an HMM of name variations
Gene and protein names follow few, if any, true naming conventions and are subject to great variation in different occurrences of the same name. This gives rise to two important p...
Lana Yeganova, Lawrence H. Smith, W. John Wilbur
COMBINATORICA
2008
84views more  COMBINATORICA 2008»
13 years 7 months ago
Parity check matrices and product representations of squares
Let NF(n, k, r) denote the maximum number of columns in an n-row matrix with entries in a finite field F in which each column has at most r nonzero entries and every k columns are...
Assaf Naor, Jacques Verstraëte
APPROX
2005
Springer
111views Algorithms» more  APPROX 2005»
14 years 1 months ago
Sampling Bounds for Stochastic Optimization
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
Moses Charikar, Chandra Chekuri, Martin Pál