Sciweavers

340 search results - page 46 / 68
» A New Algorithm for the Construction of Optimal B-Trees
Sort
View
SODA
2010
ACM
216views Algorithms» more  SODA 2010»
14 years 5 months ago
On linear and semidefinite programming relaxations for hypergraph matching
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...
Yuk Hei Chan, Lap Chi Lau
SOFTWARE
2002
13 years 7 months ago
Using Markov Chains for Link Prediction in Adaptive Web Sites
The large number of Web pages on many Web sites has raised navigational problems. Markov chains have recently been used to model user navigational behavior on the World Wide Web (W...
Jianhan Zhu, Jun Hong, John G. Hughes
CVPR
2011
IEEE
13 years 3 months ago
Learning Context for Collective Activity Recognition
In this paper we present a framework for the recognition of collective human activities. A collective activity is defined or reinforced by the existence of coherent behavior of i...
Wongun Choi, Silvio Savarese, Khuram Shahid
ICDCS
2007
IEEE
14 years 2 months ago
LagOver: Latency Gradated Overlays
We propose a new genre of overlay network for disseminating information from popular but resource constrained sources. We call this communication primitive as Latency Gradated Ove...
Anwitaman Datta, Ion Stoica, Michael J. Franklin
EOR
2008
106views more  EOR 2008»
13 years 7 months ago
Convergent Lagrangian heuristics for nonlinear minimum cost network flows
We consider the separable nonlinear and strictly convex single-commodity network flow problem (SSCNFP). We develop a computational scheme for generating a primal feasible solution...
Torbjörn Larsson, Johan Marklund, Caroline Ol...