Sciweavers

514 search results - page 6 / 103
» Multiplicative structures in additively large sets
Sort
View
JMLR
2012
11 years 10 months ago
Perturbation based Large Margin Approach for Ranking
We consider the task of devising large-margin based surrogate losses for the learning to rank problem. In this learning to rank setting, the traditional hinge loss for structured ...
Eunho Yang, Ambuj Tewari, Pradeep D. Ravikumar
SSDBM
2003
IEEE
83views Database» more  SSDBM 2003»
14 years 27 days ago
PiQA: An Algebra for Querying Protein Data Sets
Life science researchers frequently need to query large protein data sets in a variety of different ways. Protein data sets have a rich structure that includes its primary structu...
Sandeep Tata, Jignesh M. Patel
WISE
2002
Springer
14 years 16 days ago
Discovering Associations in XML Data
—Knowledge inference from semi-structured data can utilize frequent sub structures, in addition to frequency of data items. In fact, the working assumption of the present study i...
Amnon Meisels, Michael Orlov, Tal Maor
IGPL
1998
58views more  IGPL 1998»
13 years 7 months ago
Two Types of Multiple-Conclusion Systems
Hypersequents are nite sets of ordinary sequents. We show that multiple-conclusion sequents and single-conclusion hypersequents represent two di erent natural methods of switching...
Arnon Avron
DCC
2007
IEEE
14 years 7 months ago
Algorithms and Hardware Structures for Unobtrusive Real-Time Compression of Instruction and Data Address Traces
Instruction and data address traces are widely used by computer designers for quantitative evaluations of new architectures and workload characterization, as well as by software de...
Milena Milenkovic, Aleksandar Milenkovic, Martin B...