Sciweavers

933 search results - page 57 / 187
» Fully automatic cross-associations
Sort
View
HOTOS
2003
IEEE
15 years 11 months ago
Scheduling and Simulation: How to Upgrade Distributed Systems
Upgrading the software of long-lived distributed systems is difficult. It is not possible to upgrade all the nodes in a system at once, since some nodes may be down and halting t...
Sameer Ajmani, Barbara Liskov, Liuba Shrira
TSD
2001
Springer
15 years 10 months ago
Finding Semantically Related Words in Large Corpora
The paper deals with the linguistic problem of fully automatic grouping of semantically related words. We discuss the measures of semantic relatedness of basic word forms and descr...
Pavel Smrz, Pavel Rychlý
ASPDAC
2001
ACM
81views Hardware» more  ASPDAC 2001»
15 years 10 months ago
High-level specification and efficient implementation of pipelined circuits
This paper describes a novel approach to high-level synthesis of complex pipelined circuits, including pipelined circuits with feedback. This approach combines a high-level, modula...
Maria-Cristina V. Marinescu, Martin C. Rinard
DEBS
2008
ACM
15 years 8 months ago
Service oriented architecture for heterogeneous and dynamic sensor networks
Abstract--The purpose of this demo is to foster a multilevel service oriented architecture for sensor networks that fully supports network dynamicity, auto-configuration, service d...
Jeremie Leguay, Mario Lopez-Ramos, Kathlyn Jean-Ma...
ACL
2007
15 years 7 months ago
Classifying Temporal Relations Between Events
This paper describes a fully automatic twostage machine learning architecture that learns temporal relations between pairs of events. The first stage learns the temporal attribut...
Nathanael Chambers, Shan Wang, Daniel Jurafsky