Sciweavers

2463 search results - page 158 / 493
» Rankings of Directed Graphs
Sort
View
COCOON
1999
Springer
14 years 1 months ago
A New Approach for Speeding Up Enumeration Algorithms and Its Application for Matroid Bases
Abstract: We propose a new approach for speeding up enumeration algorithms. The approach does not rely on data structures deeply, instead utilizes analysis of computation time. It ...
Takeaki Uno
AMR
2006
Springer
96views Multimedia» more  AMR 2006»
14 years 1 months ago
Learning to Retrieve Images from Text Queries with a Discriminative Model
This work presents a discriminative model for the retrieval of pictures from text queries. The core idea of this approach is to minimize a loss directly related to the retrieval pe...
David Grangier, Florent Monay, Samy Bengio
CIKM
2008
Springer
13 years 11 months ago
Using English information in non-English web search
The leading web search engines have spent a decade building highly specialized ranking functions for English web pages. One of the reasons these ranking functions are effective is...
Wei Gao, John Blitzer, Ming Zhou
PODS
2006
ACM
127views Database» more  PODS 2006»
14 years 9 months ago
Evolution of page popularity under random web graph models
The link structure of the Web can be viewed as a massive graph. The preferential attachment model and its variants are well-known random graph models that help explain the evoluti...
Rajeev Motwani, Ying Xu 0002
SMA
2003
ACM
118views Solid Modeling» more  SMA 2003»
14 years 2 months ago
Graph based topological analysis of tessellated surfaces
In this paper a graph-based method is presented which not only characterizes topological classification of the tessellated surfaces but also simultaneously generates the substanti...
Tula Ram Ban, Dibakar Sen