Sciweavers

4137 search results - page 85 / 828
» On the number of matchings of a tree
Sort
View
CORR
2010
Springer
94views Education» more  CORR 2010»
14 years 9 months ago
Partitions and Coverings of Trees by Bounded-Degree Subtrees
This paper addresses the following questions for a given tree T and integer d 2: (1) What is the minimum number of degree-d subtrees that partition E(T)? (2) What is the minimum n...
David R. Wood
CORR
2010
Springer
141views Education» more  CORR 2010»
15 years 16 days ago
Popularity at Minimum Cost
We consider an extension of the popular matching problem in this paper. The input to the popular matching problem is a bipartite graph G = (A ∪ B, E), where A is a set of people,...
Telikepalli Kavitha, Meghana Nasre, Prajakta Nimbh...
240
Voted
ICDE
2002
IEEE
163views Database» more  ICDE 2002»
16 years 3 months ago
Keyword Searching and Browsing in Databases using BANKS
With the growth of the Web, there has been a rapid increase in the number of users who need to access online databases without having a detailed knowledge of the schema or of quer...
Gaurav Bhalotia, Arvind Hulgeri, Charuta Nakhe, So...
SIGMOD
2004
ACM
184views Database» more  SIGMOD 2004»
16 years 2 months ago
Identifying Similarities, Periodicities and Bursts for Online Search Queries
We present several methods for mining knowledge from the query logs of the MSN search engine. Using the query logs, we build a time series for each query word or phrase (e.g., `Th...
Michail Vlachos, Christopher Meek, Zografoula Vage...
ROMAN
2007
IEEE
181views Robotics» more  ROMAN 2007»
15 years 8 months ago
Efficient Articulated Model Fitting on a Single Image or a Sequence
Abstract—Models that can efficiently, compactly, and semantically represent potential users are important tools for human-robot interaction applications. We model a person as a p...
Matheen Siddiqui, Gérard G. Medioni