Sciweavers

356 search results - page 60 / 72
» A computational approach to negative priming
Sort
View
TON
2002
75views more  TON 2002»
13 years 9 months ago
Optimal retrial and timeout strategies for accessing network resources
The notion of timeout (namely, the maximal time to wait before retrying an action) turns up in many networking contexts, such as packet transmission, connection establishment, etc....
Lavy Libman, Ariel Orda
CIKM
2011
Springer
12 years 9 months ago
Exploiting longer cycles for link prediction in signed networks
We consider the problem of link prediction in signed networks. Such networks arise on the web in a variety of ways when users can implicitly or explicitly tag their relationship w...
Kai-Yang Chiang, Nagarajan Natarajan, Ambuj Tewari...
BMCBI
2005
102views more  BMCBI 2005»
13 years 9 months ago
BioCreAtIvE Task1A: entity identification with a stochastic tagger
Background: Our approach to Task 1A was inspired by Tanabe and Wilbur's ABGene system [1,2]. Like Tanabe and Wilbur, we approached the problem as one of part-of-speech taggin...
Shuhei Kinoshita, K. Bretonnel Cohen, Philip V. Og...
PADL
2009
Springer
14 years 10 months ago
Declarative Programming of User Interfaces
This paper proposes a declarative description of user interfaces that s from low-level implementation details. In particular, the user interfaces specified in our framework are exe...
Christof Kluß, Michael Hanus
CCS
2009
ACM
14 years 10 months ago
Logging key assurance indicators in business processes
Management of a modern enterprise is based on the assumption that executive reports of lower-layer management are faithful to what is actually happening in the field. As some well...
Fabio Massacci, Gene Tsudik, Artsiom Yautsiukhin