Sciweavers

1054 search results - page 179 / 211
» A Formalization of the Turing Test
Sort
View
ENTCS
2007
126views more  ENTCS 2007»
14 years 12 months ago
Modelling Calculi with Name Mobility using Graphs with Equivalences
In the theory of graph rewriting, the use of coalescing rules, i.e., of rules which besides deleting and generating graph items, can coalesce some parts of the graph, turns out to...
Paolo Baldan, Fabio Gadducci, Ugo Montanari
JSAC
2006
120views more  JSAC 2006»
14 years 12 months ago
Multiple-Source Internet Tomography
Abstract-- Information about the topology and link-level characteristics of a network is critical for many applications including network diagnostics and management. However, this ...
Michael Rabbat, Mark Coates, Robert D. Nowak
JUCS
2006
92views more  JUCS 2006»
14 years 12 months ago
Program Slicing by Calculation
: Program slicing is a well known family of techniques used to identify code fragments which depend on or are depended upon specific program entities. They are particularly useful ...
Nuno F. Rodrigues, Luís Soares Barbosa
PR
2006
84views more  PR 2006»
14 years 11 months ago
Clustering techniques for protein surfaces
Though most approaches to protein comparison are based on their structure, several studies produced evidence of a strict correlation between the surface characteristics of protein...
Lorenzo Baldacci, Matteo Golfarelli, Alessandra Lu...
SIGMOD
2008
ACM
118views Database» more  SIGMOD 2008»
14 years 11 months ago
NAGA: harvesting, searching and ranking knowledge
The presence of encyclopedic Web sources, such as Wikipedia, the Internet Movie Database (IMDB), World Factbook, etc. calls for new querying techniques that are simple and yet mor...
Gjergji Kasneci, Fabian M. Suchanek, Georgiana Ifr...