Sciweavers

7519 search results - page 1427 / 1504
» Optimizing Generic Functions
Sort
View
FSTTCS
2009
Springer
15 years 9 months ago
Fractional Pebbling and Thrifty Branching Programs
We study the branching program complexity of the tree evaluation problem, introduced in [BCM+09a] as a candidate for separating NL from LogCFL. The input to the problem is a roote...
Mark Braverman, Stephen A. Cook, Pierre McKenzie, ...
118
Voted
STOC
2007
ACM
134views Algorithms» more  STOC 2007»
16 years 2 months ago
Hardness of routing with congestion in directed graphs
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khann...
COCO
2003
Springer
118views Algorithms» more  COCO 2003»
15 years 7 months 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
BMCBI
2010
113views more  BMCBI 2010»
15 years 2 months ago
Improving performance of mammalian microRNA target prediction
Background: MicroRNAs (miRNAs) are single-stranded non-coding RNAs known to regulate a wide range of cellular processes by silencing the gene expression at the protein and/or mRNA...
Hui Liu, Dong Yue, Yidong Chen, Shou-Jiang Gao, Yu...
CVPR
2003
IEEE
16 years 4 months ago
Generalized Principal Component Analysis (GPCA)
This paper presents an algebro-geometric solution to the problem of segmenting an unknown number of subspaces of unknown and varying dimensions from sample data points. We represen...
René Vidal, Shankar Sastry, Yi Ma
« Prev « First page 1427 / 1504 Last » Next »