Sciweavers

2266 search results - page 61 / 454
» Generalizing parametric timing analysis
Sort
View
129
Voted
BMCBI
2008
138views more  BMCBI 2008»
15 years 2 months ago
Combining transcriptional datasets using the generalized singular value decomposition
Background: Both microarrays and quantitative real-time PCR are convenient tools for studying the transcriptional levels of genes. The former is preferable for large scale studies...
Andreas W. Schreiber, Neil J. Shirley, Rachel A. B...
WWW
2009
ACM
16 years 3 months ago
General auction mechanism for search advertising
In sponsored search, a number of advertising slots is available on a search results page, and have to be allocated among a set of advertisers competing to display an ad on the pag...
Dávid Pál, Gagan Aggarwal, Martin P&...
134
Voted
STOC
2004
ACM
157views Algorithms» more  STOC 2004»
16 years 2 months ago
Derandomizing homomorphism testing in general groups
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
Amir Shpilka, Avi Wigderson
COCOON
2007
Springer
15 years 8 months ago
Connected Coloring Completion for General Graphs: Algorithms and Complexity
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
Benny Chor, Michael R. Fellows, Mark A. Ragan, Igo...
TKDE
2010
200views more  TKDE 2010»
15 years 24 days ago
Incremental and General Evaluation of Reverse Nearest Neighbors
This paper presents a novel algorithm for Incremental and General Evaluation of continuous Reverse Nearest neighbor queries (IGERN, for short). The IGERN algorithm is general in t...
James M. Kang, Mohamed F. Mokbel, Shashi Shekhar, ...