Sciweavers

3395 search results - page 429 / 679
» Learning to efficiently rank
Sort
View
DEXA
2010
Springer
182views Database» more  DEXA 2010»
15 years 6 months ago
Minimum Spanning Tree on Spatio-Temporal Networks
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...
Viswanath Gunturi, Shashi Shekhar, Arnab Bhattacha...
150
Voted
DKE
2008
96views more  DKE 2008»
15 years 6 months ago
Fragment-based approximate retrieval in highly heterogeneous XML collections
Due to the heterogeneous nature of XML data for internet applications exact matching of queries is often inadequate. The need arises to quickly identify subtrees of XML documents ...
Ismael Sanz, Marco Mesiti, Giovanna Guerrini, Rafa...
IR
2006
15 years 6 months ago
Full-text federated search of text-based digital libraries in peer-to-peer networks
Abstract. Peer-to-peer (P2P) networks integrate autonomous computing resources without requiring a central coordinating authority, which makes them a potentially robust and scalabl...
Jie Lu, Jamie Callan
SIAMSC
2008
113views more  SIAMSC 2008»
15 years 6 months ago
Statistical Condition Estimation for the Roots of Polynomials
This paper presents fast and reliable condition estimates for the roots of a real polynomial based on the method of statistical condition estimation (SCE) by Kenney and Laub. Using...
A. J. Laub, J. Xia
SIGECOM
2008
ACM
158views ECommerce» more  SIGECOM 2008»
15 years 6 months ago
Information revelation and random entry in sequential ascending auctions
We examine a model in which multiple buyers with single-unit demand are faced with an infinite sequence of auctions. New buyers arrive on the market probabilistically, and are each...
Maher Said