Sciweavers

264 search results - page 51 / 53
» Making Argumentation More Believable
Sort
View
IPCO
2001
184views Optimization» more  IPCO 2001»
13 years 8 months ago
Approximation Algorithms for the Minimum Bends Traveling Salesman Problem
Problem (Extended Abstract) Cliff Stein David P. Wagner Dartmouth College Computer Science Technical Report TR2000-367 May 9, 2000 The problem of traversing a set of points in the...
Clifford Stein, David P. Wagner
FIW
2003
120views Communications» more  FIW 2003»
13 years 8 months ago
A Policy Architecture for Enhancing and Controlling Features
Abstract. Features provide extensions to a basic service, but in new systems users require much greater flexibility oriented towards their needs. Traditional features do not easil...
Stephan Reiff-Marganiec, Kenneth J. Turner
SIGCOMM
2010
ACM
13 years 7 months ago
Design and implementation of an "approximate" communication system for wireless media applications
All practical wireless communication systems are prone to errors. At the symbol level such wireless errors have a well-defined structure: when a receiver decodes a symbol erroneou...
Sayandeep Sen, Syed Gilani, Shreesha Srinath, Step...
BMCBI
2010
154views more  BMCBI 2010»
13 years 7 months ago
Motif Enrichment Analysis: a unified framework and an evaluation on ChIP data
Background: A major goal of molecular biology is determining the mechanisms that control the transcription of genes. Motif Enrichment Analysis (MEA) seeks to determine which DNA-b...
Robert C. McLeay, Timothy L. Bailey
AO
2006
127views more  AO 2006»
13 years 7 months ago
Formal ontology meets industry
in ontology is quite abstract and often based on toy-examples to the point that the gap between the work of theoreticians and the needs of real applications is too wide to be cross...
Stefano Borgo, Matteo Cristani, Roberta Cuel