Sciweavers

11160 search results - page 385 / 2232
» Incompleteness in a General Setting
Sort
View
STOC
2007
ACM
181views Algorithms» more  STOC 2007»
16 years 7 months ago
How to rank with few errors
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted generalization gives a PTAS for KemenyYoung ran...
Claire Kenyon-Mathieu, Warren Schudy
ICCAD
1990
IEEE
57views Hardware» more  ICCAD 1990»
15 years 11 months ago
Floorplanning with Pin Assignment
We present a hierarchicaltechniquefor floorplanning and pin assignment of the general cell layouts. Given a set of cells with their shape lists, a layout aspect ratio, relative po...
Massoud Pedram, Malgorzata Marek-Sadowska, Ernest ...
IEICET
2007
114views more  IEICET 2007»
15 years 6 months ago
Analytic Optimization of Adaptive Ridge Parameters Based on Regularized Subspace Information Criterion
In order to obtain better learning results in supervised learning, it is important to choose model parameters appropriately. Model selection is usually carried out by preparing a ...
Shun Gokita, Masashi Sugiyama, Keisuke Sakurai
ACL
2010
15 years 4 months ago
Generating Focused Topic-Specific Sentiment Lexicons
We present a method for automatically generating focused and accurate topicspecific subjectivity lexicons from a general purpose polarity lexicon that allow users to pin-point sub...
Valentin Jijkoun, Maarten de Rijke, Wouter Weerkam...
ICDM
2005
IEEE
139views Data Mining» more  ICDM 2005»
16 years 13 days ago
Approximate Inverse Frequent Itemset Mining: Privacy, Complexity, and Approximation
In order to generate synthetic basket data sets for better benchmark testing, it is important to integrate characteristics from real-life databases into the synthetic basket data ...
Yongge Wang, Xintao Wu