Results 1  10
of
681,498
WordNet: An online lexical database
 International Journal of Lexicography
, 1990
"... WordNet is an online lexical reference system whose design is inspired by current ..."
Abstract

Cited by 1945 (9 self)
 Add to MetaCart
WordNet is an online lexical reference system whose design is inspired by current
Multidimensional online binpacking: An algorithm and its averagecase analysis
 Information Processing Letters
, 1993
"... We describe an algorithm for online ddimensional bin packing which achieves O(n d+1 d+2 ) average wasted space. This algorithm runs in linear time in the number of items packed. ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
We describe an algorithm for online ddimensional bin packing which achieves O(n d+1 d+2 ) average wasted space. This algorithm runs in linear time in the number of items packed.
Suffix arrays: A new method for online string searches
, 1991
"... A new and conceptually simple data structure, called a suffix array, for online string searches is introduced in this paper. Constructing and querying suffix arrays is reduced to a sort and search paradigm that employs novel algorithms. The main advantage of suffix arrays over suffix trees is that ..."
Abstract

Cited by 827 (0 self)
 Add to MetaCart
A new and conceptually simple data structure, called a suffix array, for online string searches is introduced in this paper. Constructing and querying suffix arrays is reduced to a sort and search paradigm that employs novel algorithms. The main advantage of suffix arrays over suffix trees
A DecisionTheoretic Generalization of onLine Learning and an Application to Boosting
, 1996
"... ..."
Perfect Packing Theorems and the AverageCase Behavior of Optimal and Online Bin Packing
 SIAM Review
, 2002
"... We consider the onedimensional bin packing problem under the discrete uniform distributions U{j, k}, 1 1, in which the bin capacity is k and item sizes are chosen uniformly from the set 2, . . . , j}. Note that for 0 < u = j/k 1 this is a discrete version of the previously studied ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
continuous uniform distribution U(0, u], where the bin capacity is 1 and item sizes are chosen uniformly from the interval (0, u]. We show that the averagecase performance of heuristics can di#er substantially between the two types of distributions. In particular, there is an online algorithm that has
Planning Algorithms
, 2004
"... This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning, planning ..."
Abstract

Cited by 1108 (51 self)
 Add to MetaCart
This book presents a unified treatment of many different kinds of planning algorithms. The subject lies at the crossroads between robotics, control theory, artificial intelligence, algorithms, and computer graphics. The particular subjects covered include motion planning, discrete planning
A new learning algorithm for blind signal separation

, 1996
"... A new online learning algorithm which minimizes a statistical dependency among outputs is derived for blind separation of mixed signals. The dependency is measured by the average mutual information (MI) of the outputs. The source signals and the mixing matrix are unknown except for the number of ..."
Abstract

Cited by 614 (80 self)
 Add to MetaCart
A new online learning algorithm which minimizes a statistical dependency among outputs is derived for blind separation of mixed signals. The dependency is measured by the average mutual information (MI) of the outputs. The source signals and the mixing matrix are unknown except for the number
Improved algorithms for optimal winner determination in combinatorial auctions and generalizations
, 2000
"... Combinatorial auctions can be used to reach efficient resource and task allocations in multiagent systems where the items are complementary. Determining the winners is NPcomplete and inapproximable, but it was recently shown that optimal search algorithms do very well on average. This paper present ..."
Abstract

Cited by 598 (55 self)
 Add to MetaCart
Combinatorial auctions can be used to reach efficient resource and task allocations in multiagent systems where the items are complementary. Determining the winners is NPcomplete and inapproximable, but it was recently shown that optimal search algorithms do very well on average. This paper
An Efficient Boosting Algorithm for Combining Preferences
, 1999
"... The problem of combining preferences arises in several applications, such as combining the results of different search engines. This work describes an efficient algorithm for combining multiple preferences. We first give a formal framework for the problem. We then describe and analyze a new boosting ..."
Abstract

Cited by 707 (18 self)
 Add to MetaCart
boosting algorithm for combining preferences called RankBoost. We also describe an efficient implementation of the algorithm for certain natural cases. We discuss two experiments we carried out to assess the performance of RankBoost. In the first experiment, we used the algorithm to combine different WWW
The Omega Test: a fast and practical integer programming algorithm for dependence analysis
 Communications of the ACM
, 1992
"... The Omega testi s ani nteger programmi ng algori thm that can determi ne whether a dependence exi sts between two array references, and i so, under what condi7: ns. Conventi nalwi[A m holds thati nteger programmiB techni:36 are far too expensi e to be used for dependence analysi6 except as a method ..."
Abstract

Cited by 521 (15 self)
 Add to MetaCart
programs, the average ti me requi red by the Omega test to determi ne the di recti on vectors for an array pai ri s less than 500 secs on a 12 MIPS workstati on. The Omega testi based on an extensi n of Four i0Motzki var i ble eli937 ti n (aliB: r programmiA method) toi nteger programmi ng, and has worstcase
Results 1  10
of
681,498