Sciweavers

1629 search results - page 253 / 326
» Hardness Results and Efficient Algorithms for Graph Powers
Sort
View
KDD
2010
ACM
272views Data Mining» more  KDD 2010»
14 years 8 months ago
Scalable similarity search with optimized kernel hashing
Scalable similarity search is the core of many large scale learning or data mining applications. Recently, many research results demonstrate that one promising approach is creatin...
Junfeng He, Wei Liu, Shih-Fu Chang
ICFP
2008
ACM
15 years 9 months ago
Write it recursively: a generic framework for optimal path queries
Optimal path queries are queries to obtain an optimal path specified by a given criterion of optimality. There have been many studies to give efficient algorithms for classes of o...
Akimasa Morihata, Kiminori Matsuzaki, Masato Takei...
APLAS
2010
ACM
14 years 8 months ago
Type Inference for Sublinear Space Functional Programming
We consider programming language aspects of algorithms that operate on data too large to fit into memory. In previous work we have introduced IntML, a functional programming langu...
Ugo Dal Lago, Ulrich Schöpp
ESTIMEDIA
2007
Springer
15 years 4 months ago
Run-time Task Overlapping on Multiprocessor Platforms
Today’s embedded applications often consist of multiple concurrent tasks. These tasks are decomposed into subtasks which are in turn assigned and scheduled on multiple different...
Zhe Ma, Daniele Paolo Scarpazza, Francky Catthoor
WADS
2005
Springer
162views Algorithms» more  WADS 2005»
15 years 3 months ago
The Minimum-Area Spanning Tree Problem
Motivated by optimization problems in sensor coverage, we formulate and study the Minimum-Area Spanning Tree (mast) problem: Given a set P of n points in the plane, find a spannin...
Paz Carmi, Matthew J. Katz, Joseph S. B. Mitchell