Sciweavers

1977 search results - page 281 / 396
» The satisfactory partition problem
Sort
View
ICTIR
2009
Springer
15 years 10 months ago
"A term is known by the company it keeps": On Selecting a Good Expansion Set in Pseudo-Relevance Feedback
Abstract. It is well known that pseudo-relevance feedback (PRF) improves the retrieval performance of Information Retrieval (IR) systems in general. However, a recent study by Cao ...
Raghavendra Udupa, Abhijit Bhole, Pushpak Bhattach...
156
Voted
IWCIA
2009
Springer
15 years 10 months ago
Signatures of Combinatorial Maps
Abstract. In this paper, we address the problem of computing a canonical representation of an n-dimensional combinatorial map. To do so, we define two combinatorial map signatures...
Stéphane Gosselin, Guillaume Damiand, Chris...
142
Voted
IROS
2007
IEEE
254views Robotics» more  IROS 2007»
15 years 10 months ago
3D datasets segmentation based on local attribute variation
— We present a Graph-based method for low-level segmentation of unfiltered 3D data. The core of this approach is based on the construction of a local neighborhood structure and ...
Carla Silva Rocha Aguiar, Sébastien Druon, ...
166
Voted
VISUALIZATION
2005
IEEE
15 years 9 months ago
Visualizing intersecting surfaces with nested-surface techniques
This paper describes the adaptation and evaluation of existing nestedsurface visualization techniques for the problem of displaying intersecting surfaces. For this work, we collab...
Chris Weigle, Russell M. Taylor II
157
Voted
SWAT
2010
Springer
250views Algorithms» more  SWAT 2010»
15 years 8 months ago
Fixed-Parameter Algorithms for Cochromatic Number and Disjoint Rectangle Stabbing
Given a permutation π of {1, . . . , n} and a positive integer k, we give an algorithm with running time 2O(k2 log k) nO(1) that decides whether π can be partitioned into at mos...
Pinar Heggernes, Dieter Kratsch, Daniel Lokshtanov...