Sciweavers

236 search results - page 36 / 48
» Profiling Sets for Preference Querying
Sort
View
65
Voted
PRL
2000
104views more  PRL 2000»
14 years 9 months ago
PicSOM - content-based image retrieval with self-organizing maps
We have developed a novel system for content-based image retrieval in large, unannotated databases. The system is called PicSOM, and it is based on tree structured self-organizing...
Jorma Laaksonen, Markus Koskela, Sami Laakso, Erkk...
EDBT
2000
ACM
15 years 1 months ago
A Data Model for Effectively Computable Functions
the research activities. This abstract is to introduce the approach of a data model - EP data model. Its data structure is able to store as a finite set of nodes arbitrary effectiv...
Kevin H. Xu
SIGECOM
2008
ACM
155views ECommerce» more  SIGECOM 2008»
14 years 9 months ago
Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
Vahab S. Mirrokni, Michael Schapira, Jan Vondr&aac...
NAR
2011
182views Computer Vision» more  NAR 2011»
14 years 15 days ago
PAIR: the predicted Arabidopsis interactome resource
The predicted Arabidopsis interactome resource (PAIR, http://www.cls.zju.edu.cn/pair/), comprised of 5990 experimentally reported molecular interactions in Arabidopsis thaliana to...
Mingzhi Lin, Xueling Shen, Xin Chen
80
Voted
SIGMOD
2010
ACM
202views Database» more  SIGMOD 2010»
15 years 2 months ago
PAROS: pareto optimal route selection
Modern maps provide a variety of information about roads and their surrounding landscape allowing navigation systems to go beyond simple shortest path computation. In this demo, w...
Franz Graf, Hans-Peter Kriegel, Matthias Renz, Mat...