Sciweavers

15033 search results - page 82 / 3007
» Complexity Theory and Algorithms
Sort
View
104
Voted
ENC
2003
IEEE
15 years 9 months ago
Efficient Compression from Non-ergodic Sources with Genetic Algorithms
Several lossless data compression schemes have been proposed over the past years. Since Shannon developed information theory in his seminal paper, however, the problem of data com...
Angel Fernando Kuri Morales
164
Voted
TNN
2008
97views more  TNN 2008»
15 years 3 months ago
Training Hard-Margin Support Vector Machines Using Greedy Stagewise Algorithm
Hard-margin support vector machines (HM-SVMs) suffer from getting overfitting in the presence of noise. Soft-margin SVMs deal with this problem by introducing a regularization term...
Liefeng Bo, Ling Wang, Licheng Jiao
97
Voted
MM
2005
ACM
103views Multimedia» more  MM 2005»
15 years 9 months ago
Diorama table
“diorama table “ is an interactive table installation. People place physical objects on the table and projected elements such as trains, cars, houses, and trees appear and are...
Keiko Takahashi, Shinji Sasada
132
Voted
COMPGEOM
2003
ACM
15 years 9 months ago
Finding a curve in a map
Given a polygonal curve and a geometric graph, we describe an efficient algorithm to find a path in the graph which is most similar to the curve, using the well-known Fr´echet d...
Carola Wenk, Helmut Alt, Alon Efrat, Lingeshwaran ...
123
Voted
CORR
2008
Springer
84views Education» more  CORR 2008»
15 years 3 months ago
The Latent Relation Mapping Engine: Algorithm and Experiments
Many AI researchers and cognitive scientists have argued that analogy is the core of cognition. The most influential work on computational modeling of analogy-making is Structure ...
Peter D. Turney