Sciweavers

10055 search results - page 1973 / 2011
» Structured programming using processes
Sort
View
ICALP
2009
Springer
14 years 9 months ago
Counting Subgraphs via Homomorphisms
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
Omid Amini, Fedor V. Fomin, Saket Saurabh
DAC
2002
ACM
14 years 9 months ago
Dynamic hardware plugins in an FPGA with partial run-time reconfiguration
Tools and a design methodology have been developed to support partial run-time reconfiguration of FPGA logic on the Field Programmable Port Extender. High-speed Internet packet pr...
Edson L. Horta, John W. Lockwood, David E. Taylor,...
WWW
2007
ACM
14 years 9 months ago
Preference-based selection of highly configurable web services
A key challenge for dynamic Web service selection is that Web services are typically highly configurable and service requesters often have dynamic preferences on service configura...
Steffen Lamparter, Anupriya Ankolekar, Rudi Studer...
WWW
2004
ACM
14 years 9 months ago
Schemapath, a minimal extension to xml schema for conditional constraints
In the past few years, a number of constraint languages for XML documents has been proposed. They are cumulatively called schema languages or validation languages and they compris...
Claudio Sacerdoti Coen, Paolo Marinelli, Fabio Vit...
KDD
2004
ACM
196views Data Mining» more  KDD 2004»
14 years 9 months ago
Adversarial classification
Essentially all data mining algorithms assume that the datagenerating process is independent of the data miner's activities. However, in many domains, including spam detectio...
Nilesh N. Dalvi, Pedro Domingos, Mausam, Sumit K. ...
« Prev « First page 1973 / 2011 Last » Next »