Sciweavers

115 search results - page 19 / 23
» Generating All Sets With Bounded Unions
Sort
View
CCO
2001
Springer
161views Combinatorics» more  CCO 2001»
13 years 12 months ago
Branch, Cut, and Price: Sequential and Parallel
Branch, cut, and price (BCP) is an LP-based branch and bound technique for solving large-scale discrete optimization problems (DOPs). In BCP, both cuts and variables can be generat...
Laszlo Ladányi, Ted K. Ralphs, Leslie E. Tr...
KDD
2009
ACM
194views Data Mining» more  KDD 2009»
14 years 8 months ago
Combining link and content for community detection: a discriminative approach
In this paper, we consider the problem of combining link and content analysis for community detection from networked data, such as paper citation networks and Word Wide Web. Most ...
Tianbao Yang, Rong Jin, Yun Chi, Shenghuo Zhu
EDBT
2006
ACM
136views Database» more  EDBT 2006»
14 years 7 months ago
Optimizing Monitoring Queries over Distributed Data
Scientific data in the life sciences is distributed over various independent multi-format databases and is constantly expanding. We discuss a scenario where a life science research...
Frank Neven, Dieter Van de Craen
CGO
2003
IEEE
14 years 23 days ago
Addressing Mode Selection
Many processor architectures provide a set of addressing modes in their address generation units. For example DSPs (digital signal processors) have powerful addressing modes for e...
Erik Eckstein, Bernhard Scholz
FIW
2003
115views Communications» more  FIW 2003»
13 years 8 months ago
Generalising Feature Interactions in Email
We report on a property-based approach to feature interaction analysis for a client-server email system. The model is based upon Hall’s email model [12] presented at FIW’00 [3]...
Muffy Calder, Alice Miller