Sciweavers

6266 search results - page 50 / 1254
» New results on the computability and complexity of points - ...
Sort
View
FSTTCS
2008
Springer
13 years 10 months ago
Complexity Analysis of Term Rewriting Based on Matrix and Context Dependent Interpretations
For a given (terminating) term rewriting system one can often estimate its derivational complexity indirectly by looking at the proof method that established termination. In this s...
Georg Moser, Andreas Schnabl, Johannes Waldmann
CORR
2007
Springer
74views Education» more  CORR 2007»
13 years 8 months ago
Secure Two-party Protocols for Point Inclusion Problem
It is well known that, in theory, the general secure multiparty computation problem is solvable using circuit evaluation protocols. However, the communication complexity of the re...
Tony Thomas
KDD
2008
ACM
156views Data Mining» more  KDD 2008»
14 years 9 months ago
Can complex network metrics predict the behavior of NBA teams?
The United States National Basketball Association (NBA) is one of the most popular sports league in the world and is well known for moving a millionary betting market that uses th...
Antonio Alfredo Ferreira Loureiro, Pedro O. S. Vaz...
EVOW
2008
Springer
13 years 10 months ago
Divide, Align and Full-Search for Discovering Conserved Protein Complexes
Advances in modern technologies for measuring protein-protein interaction (PPI) has boosted research in PPI networks analysis and comparison. One of the challenging problems in com...
Pavol Jancura, Jaap Heringa, Elena Marchiori
ICCD
2004
IEEE
113views Hardware» more  ICCD 2004»
14 years 5 months ago
End-to-End Testability Analysis and DfT Insertion for Mixed-Signal Paths
Increasing system complexity and test cost demands new system-level solutions for mixed-signal systems. In this paper, we present a testability analysis and DfT insertion methodol...
Sule Ozev, Alex Orailoglu