Sciweavers

2635 search results - page 513 / 527
» Computing multihomogeneous resultants using straight-line pr...
Sort
View
AI
2000
Springer
13 years 8 months ago
Learning to construct knowledge bases from the World Wide Web
The World Wide Web is a vast source of information accessible to computers, but understandable only to humans. The goal of the research described here is to automatically create a...
Mark Craven, Dan DiPasquo, Dayne Freitag, Andrew M...
ICSOC
2010
Springer
13 years 7 months ago
A Programmble Fault Injection Testbed Generator for SOA
In this demo paper we present the prototype of our fault injection testbed generator. Our tool empowers engineers to generate emulated SOA environments and to program fault injecti...
Lukasz Juszczyk, Schahram Dustdar
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
IANDC
2008
141views more  IANDC 2008»
13 years 8 months ago
Graph connectivity, partial words, and a theorem of Fine and Wilf
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, has important applications in several areas including data compression, string se...
Francine Blanchet-Sadri, Deepak Bal, Gautam Sisodi...
DAC
2006
ACM
14 years 9 months ago
High-level power management of embedded systems with application-specific energy cost functions
Most existing dynamic voltage scaling (DVS) schemes for multiple tasks assume an energy cost function (energy consumption versus execution time) that is independent of the task ch...
Youngjin Cho, Naehyuck Chang, Chaitali Chakrabarti...