Sciweavers

2137 search results - page 394 / 428
» Approximation Algorithms for Some Graph Partitioning Problem...
Sort
View
SODA
2008
ACM
109views Algorithms» more  SODA 2008»
15 years 3 months ago
Auctions for structured procurement
This paper considers a general setting for structured procurement and the problem a buyer faces in designing a procurement mechanism to maximize profit. This brings together two a...
Matthew Cary, Abraham D. Flaxman, Jason D. Hartlin...
IMC
2007
ACM
15 years 3 months ago
Learning network structure from passive measurements
The ability to discover network organization, whether in the form of explicit topology reconstruction or as embeddings that approximate topological distance, is a valuable tool. T...
Brian Eriksson, Paul Barford, Robert Nowak, Mark C...
BMCBI
2008
160views more  BMCBI 2008»
15 years 2 months ago
Feature selection environment for genomic applications
Background: Feature selection is a pattern recognition approach to choose important variables according to some criteria in order to distinguish or explain certain phenomena (i.e....
Fabrício Martins Lopes, David Correa Martin...
VLDB
2001
ACM
82views Database» more  VLDB 2001»
15 years 6 months ago
Supporting Incremental Join Queries on Ranked Inputs
This paper investigates the problem of incremental joins of multiple ranked data sets when the join condition is a list of arbitrary user-defined predicates on the input tuples. ...
Apostol Natsev, Yuan-Chi Chang, John R. Smith, Chu...
SIGMOD
2005
ACM
133views Database» more  SIGMOD 2005»
16 years 2 months ago
Constrained Optimalities in Query Personalization
Personalization is a powerful mechanism that helps users to cope with the abundance of information on the Web. Database query personalization achieves this by dynamically construc...
Georgia Koutrika, Yannis E. Ioannidis