Sciweavers

674 search results - page 12 / 135
» From Constructibility and Absoluteness to Computability and ...
Sort
View
JAIR
2010
139views more  JAIR 2010»
14 years 10 months ago
Multiattribute Auctions Based on Generalized Additive Independence
We develop multiattribute auctions that accommodate generalized additive independent (GAI) preferences. We propose an iterative auction mechanism that maintains prices on potentia...
Yagil Engel, Michael P. Wellman
ACL
2010
14 years 9 months ago
Experiments in Graph-Based Semi-Supervised Learning Methods for Class-Instance Acquisition
Graph-based semi-supervised learning (SSL) algorithms have been successfully used to extract class-instance pairs from large unstructured and structured text collections. However,...
Partha Pratim Talukdar, Fernando Pereira
IPPS
1998
IEEE
15 years 3 months ago
Configuration Independent Analysis for Characterizing Shared-Memory Applications
Characterizing shared-memory applications provides insight to design efficient systems, and provides awareness to identify and correct application performance bottlenecks. Configu...
Gheith A. Abandah, Edward S. Davidson
RECOMB
2005
Springer
15 years 12 months ago
Graph Theoretical Insights into Evolution of Multidomain Proteins
We study properties of multidomain proteins from a graph theoretical perspective. In particular, we demonstrate connections between properties of the domain overlap graph and certa...
Teresa M. Przytycka, George Davis, Nan Song, Danni...
86
Voted
COCO
2009
Springer
128views Algorithms» more  COCO 2009»
15 years 6 months ago
Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs
We study the inapproximability of Vertex Cover and Independent Set on degree d graphs. We prove that: • Vertex Cover is Unique Games-hard to approximate to within a factor 2−(...
Per Austrin, Subhash Khot, Muli Safra