Sciweavers

1441 search results - page 60 / 289
» Multiple instance ranking
Sort
View
IANDC
2007
123views more  IANDC 2007»
13 years 9 months ago
Hardness of fully dense problems
In the past decade, there has been a stream of work in designing approximation schemes for dense instances of NP-Hard problems. These include the work of Arora, Karger and Karpins...
Nir Ailon, Noga Alon
SIGMOD
2001
ACM
108views Database» more  SIGMOD 2001»
14 years 10 months ago
PREFER: A System for the Efficient Execution of Multi-parametric Ranked Queries
Users often need to optimize the selection of objects by appropriately weighting the importance of multiple object attributes. Such optimization problems appear often in operation...
Vagelis Hristidis, Nick Koudas, Yannis Papakonstan...
CORR
2010
Springer
93views Education» more  CORR 2010»
13 years 10 months ago
Rank Awareness in Joint Sparse Recovery
In this paper we revisit the sparse multiple measurement vector (MMV) problem, where the aim is to recover a set of jointly sparse multichannel vectors from incomplete measurement...
Mike E. Davies, Yonina C. Eldar
WWW
2007
ACM
14 years 10 months ago
Automatic searching of tables in digital libraries
Tables are ubiquitous. Unfortunately, no search engine supports table search. In this paper, we propose a novel table specific searching engine, TableSeer, to facilitate the table...
Ying Liu, Kun Bai, Prasenjit Mitra, C. Lee Giles
BROADNETS
2005
IEEE
14 years 3 months ago
Network selection using fuzzy logic
—The peer-to-peer technology offers many advantages, but at the same time, it poses many novel challenges for the research community. Modern peer-to-peer systems are characterize...
Shubha Kher, Arun K. Somani, Rohit Gupta