Sciweavers

1225 search results - page 154 / 245
» The Instance Complexity Conjecture
Sort
View
ICTAI
2008
IEEE
14 years 3 months ago
Information Extraction as an Ontology Population Task and Its Application to Genic Interactions
Ontologies are a well-motivated formal representation to model knowledge needed to extract and encode data from text. Yet, their tight integration with Information Extraction (IE)...
Alain-Pierre Manine, Érick Alphonse, Philip...
CLUSTER
2007
IEEE
14 years 3 months ago
Evaluation of fault-tolerant policies using simulation
— Various mechanisms for fault-tolerance (FT) are used today in order to reduce the impact of failures on application execution. In the case of system failure, standard FT mechan...
Anand Tikotekar, Geoffroy Vallée, Thomas Na...
COCO
2007
Springer
85views Algorithms» more  COCO 2007»
14 years 3 months ago
Norms, XOR Lemmas, and Lower Bounds for GF(2) Polynomials and Multiparty Protocols
This paper presents a unified and simple treatment of basic questions concerning two computational models: multiparty communication complexity and GF(2) polynomials. The key is t...
Emanuele Viola, Avi Wigderson
ICPP
2006
IEEE
14 years 3 months ago
Parallel Algorithms for Evaluating Centrality Indices in Real-world Networks
This paper discusses fast parallel algorithms for evaluating several centrality indices frequently used in complex network analysis. These algorithms have been optimized to exploi...
David A. Bader, Kamesh Madduri
FOCS
2005
IEEE
14 years 2 months ago
On Non-Approximability for Quadratic Programs
This paper studies the computational complexity of the following type of quadratic programs: given an arbitrary matrix whose diagonal elements are zero, find x ∈ {−1, +1}n th...
Sanjeev Arora, Eli Berger, Elad Hazan, Guy Kindler...