Sciweavers

1940 search results - page 280 / 388
» Process as Theory in Information Systems Research
Sort
View
SODA
2012
ACM
170views Algorithms» more  SODA 2012»
13 years 8 months ago
Compression via matroids: a randomized polynomial kernel for odd cycle transversal
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
Stefan Kratsch, Magnus Wahlström
INFOCOM
2009
IEEE
16 years 1 months ago
Distributed Opportunistic Scheduling With Two-Level Channel Probing
Distributed opportunistic scheduling (DOS) is studied for wireless ad-hoc networks in which many links contend for the channel using random access before data transmissions. Simpl...
P. S. Chandrashekhar Thejaswi, Junshan Zhang, Man-...
BMCBI
2006
127views more  BMCBI 2006»
15 years 6 months ago
A graph-search framework for associating gene identifiers with documents
Background: One step in the model organism database curation process is to find, for each article, the identifier of every gene discussed in the article. We consider a relaxation ...
William W. Cohen, Einat Minkov
ESWS
2004
Springer
15 years 11 months ago
Publish/Subscribe for RDF-based P2P Networks
Publish/subscribe systems are an alternative to query based systems in cases where the same information is asked for over and over, and where clients want to get updated answers fo...
Paul-Alexandru Chirita, Stratos Idreos, Manolis Ko...
ACMICEC
2006
ACM
191views ECommerce» more  ACMICEC 2006»
16 years 12 days ago
An ontology of trust: formal semantics and transitivity
This paper formalizes the semantics of trust and studies the transitivity of trust. On the Web, people and software agents have to interact with “strangers”. This makes trust ...
Jingwei Huang, Mark S. Fox