Sciweavers

16404 search results - page 3041 / 3281
» A set coverage problem
Sort
View
ALGORITHMICA
2005
225views more  ALGORITHMICA 2005»
15 years 4 months ago
Better Alternatives to OSPF Routing
The current standard for intra-domain network routing, Open Shortest Path First (OSPF), suffers from a number of problems--the tunable parameters (the weights) are hard to optimiz...
Jessica H. Fong, Anna C. Gilbert, Sampath Kannan, ...
SP
2008
IEEE
159views Security Privacy» more  SP 2008»
15 years 4 months ago
Inferring neuronal network connectivity from spike data: A temporal data mining approach
Abstract. Understanding the functioning of a neural system in terms of its underlying circuitry is an important problem in neuroscience. Recent developments in electrophysiology an...
Debprakash Patnaik, P. S. Sastry, K. P. Unnikrishn...
IJON
2007
74views more  IJON 2007»
15 years 4 months ago
Visual object concept discovery: Observations in congenitally blind children, and a computational approach
Over the course of the first few months of life, our brains accomplish a remarkable feat. They are able to interpret complex visual images so that instead of being just disconnec...
Jake V. Bouvrie, Pawan Sinha
ANOR
2005
131views more  ANOR 2005»
15 years 4 months ago
Projection, Lifting and Extended Formulation in Integer and Combinatorial Optimization
Abstract. This is an overview of the significance and main uses of projection, lifting and extended formulation in integer and combinatorial optimization. Its first two sections de...
Egon Balas
ANOR
2005
160views more  ANOR 2005»
15 years 4 months ago
Packing r-Cliques in Weighted Chordal Graphs
In Hell et al. (2004), we have previously observed that, in a chordal graph G, the maximum number of independent r-cliques (i.e., of vertex disjoint subgraphs of G, each isomorphic...
Pavol Hell, Sulamita Klein, Loana Tito Nogueira, F...
« Prev « First page 3041 / 3281 Last » Next »