Sciweavers

1995 search results - page 240 / 399
» What's the Problem
Sort
View
AAAI
1996
15 years 5 months ago
Interactive Information Retrieval Systems with Minimalist Representation
Almost any information you might want is becoming available on-line. The problem is how to find what you need. One strategy to improve access to existing information sources, is i...
Eric A. Domeshek, Smadar Kedar, Andrew S. Gordon
SDM
2009
SIAM
160views Data Mining» more  SDM 2009»
16 years 1 months ago
Discovering Substantial Distinctions among Incremental Bi-Clusters.
A fundamental task of data analysis is comprehending what distinguishes clusters found within the data. We present the problem of mining distinguishing sets which seeks to find s...
Faris Alqadah, Raj Bhatnagar
ISAAC
2005
Springer
111views Algorithms» more  ISAAC 2005»
15 years 10 months ago
Smoothed Analysis of Binary Search Trees
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
Bodo Manthey, Rüdiger Reischuk
GRID
2000
Springer
15 years 8 months ago
Architectural Models for Resource Management in the Grid
: The concept of coupling geographically distributed (high-end) resources for solving large-scale problems is becoming increasingly popular, forming what is popularly called grid c...
Rajkumar Buyya, Steve J. Chapin, David C. DiNucci
ICASSP
2010
IEEE
15 years 4 months ago
Optimal delayed decoding of predictively encoded sources
Predictive coding eliminates redundancy due to correlations between the current and past signal samples, so that only the innovation, or prediction residual, needs to be encoded. ...
Vinay Melkote, Kenneth Rose