Sciweavers

1071 search results - page 203 / 215
» Programming with enumerable sets of structures
Sort
View
DIMACS
1996
15 years 1 months ago
Easier Ways to Win Logical Games
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Ronald Fagin
BMCBI
2007
200views more  BMCBI 2007»
15 years 15 days ago
Assessment of algorithms for high throughput detection of genomic copy number variation in oligonucleotide microarray data
Background: Genomic deletions and duplications are important in the pathogenesis of diseases, such as cancer and mental retardation, and have recently been shown to occur frequent...
Ágnes Baross, Allen D. Delaney, H. Irene Li...
DAC
2002
ACM
16 years 1 months ago
Scheduler-based DRAM energy management
Previous work on DRAM power-mode management focused on hardware-based techniques and compiler-directed schemes to explicitly transition unused memory modules to low-power operatin...
Victor Delaluz, Anand Sivasubramaniam, Mahmut T. K...
122
Voted
WWW
2002
ACM
16 years 1 months ago
Accelerated focused crawling through online relevance feedback
The organization of HTML into a tag tree structure, which is rendered by browsers as roughly rectangular regions with embedded text and HREF links, greatly helps surfers locate an...
Soumen Chakrabarti, Kunal Punera, Mallela Subraman...
139
Voted
COORDINATION
2009
Springer
16 years 28 days ago
Enhanced Coordination in Sensor Networks through Flexible Service Provisioning
: Heterogeneous wireless sensor networks represent a challenging programming environment. Servilla addresses this by offering a new middleware framework that provides service provi...
Chien-Liang Fok, Gruia-Catalin Roman, Chenyang Lu