Sciweavers

1951 search results - page 354 / 391
» An algorithm for improving graph partitions
Sort
View
LREC
2010
141views Education» more  LREC 2010»
14 years 11 months ago
Exploring Knowledge Bases for Similarity
Graph-based similarity over WordNet has been previously shown to perform very well on word similarity. This paper presents a study of the performance of such a graph-based algorit...
Eneko Agirre, Montse Cuadros, German Rigau, Aitor ...
AIPS
2004
14 years 11 months ago
A Lookahead Strategy for Heuristic Search Planning
The planning as heuristic search framework, initiated by the planners ASP from Bonet, Loerincs and Geffner, and HSP from Bonet and Geffner, lead to some of the most performant pla...
Vincent Vidal
CVPR
2005
IEEE
16 years 22 hour ago
OBJ CUT
In this paper we present a principled Bayesian method for detecting and segmenting instances of a particular object category within an image, providing a coherent methodology for ...
M. Pawan Kumar, Philip H. S. Torr, Andrew Zisserma...
DAC
2006
ACM
15 years 11 months ago
Circuit simulation based obstacle-aware Steiner routing
Steiner routing is a fundamental yet NP-hard problem in VLSI design and other research fields. In this paper, we propose to model the routing graph by an RC network with routing t...
Yiyu Shi, Paul Mesa, Hao Yu, Lei He
KDD
2005
ACM
92views Data Mining» more  KDD 2005»
15 years 10 months ago
Summarizing itemset patterns: a profile-based approach
Frequent-pattern mining has been studied extensively on scalable methods for mining various kinds of patterns including itemsets, sequences, and graphs. However, the bottleneck of...
Xifeng Yan, Hong Cheng, Jiawei Han, Dong Xin