Sciweavers

516 search results - page 93 / 104
» Retroactive answering of search queries
Sort
View
KDD
2003
ACM
217views Data Mining» more  KDD 2003»
16 years 2 months ago
Algorithms for estimating relative importance in networks
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
Scott White, Padhraic Smyth
CP
2009
Springer
15 years 8 months ago
Reasoning about Optimal Collections of Solutions
The problem of finding a collection of solutions to a combinatorial problem that is optimal in terms of an inter-solution objective function exists in many application settings. F...
Tarik Hadzic, Alan Holland, Barry O'Sullivan
ICCSA
2007
Springer
15 years 8 months ago
Weak Visibility of Two Objects in Planar Polygonal Scenes
Abstract. Determining whether two segments s and t in a planar polygonal scene weakly see each other is a classical problem in computational geometry. In this problem we seek for a...
Mostafa Nouri, Alireza Zarei, Mohammad Ghodsi
116
Voted
INEX
2007
Springer
15 years 8 months ago
Using Wikipedia Categories and Links in Entity Ranking
This paper describes the participation of the INRIA group in the INEX 2007 XML entity ranking and ad hoc tracks. We developed a system for ranking Wikipedia entities in answer to a...
Anne-Marie Vercoustre, Jovan Pehcevski, James A. T...
ICCAD
1999
IEEE
90views Hardware» more  ICCAD 1999»
15 years 6 months ago
An implicit connection graph maze routing algorithm for ECO routing
Abstract-- ECO routing is a very important design capability in advanced IC, MCM and PCB designs when additional routings need to be made at the latter stage of the physical design...
Jason Cong, Jie Fang, Kei-Yong Khoo