Sciweavers

574 search results - page 81 / 115
» Approximation Algorithms for Free-Label Maximization
Sort
View
COLT
2005
Springer
14 years 2 months ago
Margin-Based Ranking Meets Boosting in the Middle
Abstract. We present several results related to ranking. We give a general margin-based bound for ranking based on the L∞ covering number of the hypothesis space. Our bound sugge...
Cynthia Rudin, Corinna Cortes, Mehryar Mohri, Robe...
FPGA
2000
ACM
114views FPGA» more  FPGA 2000»
14 years 9 days ago
Generating highly-routable sparse crossbars for PLDs
A method for evaluating and constructing sparse crossbars which are both area efficient and highly routable is presented. The evaluation method uses a network flow algorithm to ac...
Guy G. Lemieux, Paul Leventis, David M. Lewis
DGO
2008
188views Education» more  DGO 2008»
13 years 10 months ago
Enabling synergy between psychology and natural language processing for e-Government: crime reporting and investigative intervie
We are developing an automated crime reporting and investigative interview system. The system incorporates cognitive interview techniques to maximize witness memory recall, and in...
Alicia Iriberri, Chih Hao Ku, Gondy Leroy
IJCAI
2003
13 years 10 months ago
Employing Trainable String Similarity Metrics for Information Integration
The problem of identifying approximately duplicate objects in databases is an essential step for the information integration process. Most existing approaches have relied on gener...
Mikhail Bilenko, Raymond J. Mooney
IJRR
2008
115views more  IJRR 2008»
13 years 8 months ago
Planning High-quality Paths and Corridors Amidst Obstacles
The motion-planning problem, involving the computation of a collision-free path for a moving entity amidst obstacles, is a central problem in fields like Robotics and Game Design....
Ron Wein, Jur P. van den Berg, Dan Halperin