Sciweavers

322 search results - page 30 / 65
» Least Expected Cost Query Optimization: What Can We Expect
Sort
View
DASFAA
2004
IEEE
86views Database» more  DASFAA 2004»
14 years 11 days ago
Supporting Exploratory Queries in Databases
Users of database applications, especially in the e-commerce domain, often resort to exploratory "trial-and-error" queries since the underlying data space is huge and unf...
Abhijit Kadlag, Amol V. Wanjari, Juliana Freire, J...
HICSS
2006
IEEE
114views Biometrics» more  HICSS 2006»
14 years 2 months ago
Optimal Timing for Software Functionality Additions by Internet Portals
Managerial decisions regarding software functionality additions at Internet portals are interesting to senior managers involved in e-commerce. Portals can leverage software functi...
Robert J. Kauffman, Amy Ping Wu
WEBI
2010
Springer
13 years 6 months ago
Expertise Matching via Constraint-Based Optimization
Abstract--Expertise matching, aiming to find the alignment between experts and queries, is a common problem in many real applications such as conference paper-reviewer assignment, ...
Wenbin Tang, Jie Tang, Chenhao Tan
ISAAC
2005
Springer
120views Algorithms» more  ISAAC 2005»
14 years 2 months ago
Average Case Analysis for Tree Labelling Schemes
We study how to label the vertices of a tree in such a way that we can decide the distance of two vertices in the tree given only their labels. For trees, Gavoille et al. [7] prove...
Ming-Yang Kao, Xiang-Yang Li, Weizhao Wang
ITCC
2003
IEEE
14 years 1 months ago
A Method for Calculating Term Similarity on Large Document Collections
We present an efficient algorithm called the Quadtree Heuristic for identifying a list of similar terms for each unique term in a large document collection. Term similarity is de...
Wolfgang W. Bein, Jeffrey S. Coombs, Kazem Taghva