Sciweavers

4118 search results - page 382 / 824
» Efficient Algorithms for Airline Problem
Sort
View
ICDE
2009
IEEE
120views Database» more  ICDE 2009»
16 years 8 months ago
Weighted Proximity Best-Joins for Information Retrieval
We consider the problem of efficiently computing weighted proximity best-joins over multiple lists, with applications in information retrieval and extraction. We are given a multi-...
AnHai Doan, Haixun Wang, Hao He, Jun Yang 0001, Ri...
ICML
2006
IEEE
16 years 7 months ago
Multiclass boosting with repartitioning
A multiclass classification problem can be reduced to a collection of binary problems with the aid of a coding matrix. The quality of the final solution, which is an ensemble of b...
Ling Li
POPL
2007
ACM
16 years 7 months ago
Interprocedural analysis of asynchronous programs
An asynchronous program is one that contains procedure calls which are not immediately executed from the callsite, but stored and "dispatched" in a non-deterministic ord...
Ranjit Jhala, Rupak Majumdar
RECOMB
2005
Springer
16 years 7 months ago
Lower Bounds for Maximum Parsimony with Gene Order Data
Abstract. In this paper, we study lower bound techniques for branchand-bound algorithms for maximum parsimony, with a focus on gene order data. We give a simple O(n3 ) time dynamic...
Abraham Bachrach, Kevin Chen, Chris Harrelson, Rad...
ACMSE
2006
ACM
16 years 20 days ago
Discovering communities in complex networks
We propose an efficient and novel approach for discovering communities in real-world random networks. Communities are formed by subsets of nodes in a graph, which are closely rela...
Hemant Balakrishnan, Narsingh Deo