Sciweavers

9949 search results - page 78 / 1990
» On the Network Complexity of Selection
Sort
View
FCT
2003
Springer
14 years 2 months ago
On Exact and Approximation Algorithms for Distinguishing Substring Selection
Abstract. The NP-complete Distinguishing Substring Selection problem (DSSS for short) asks, given a set of “good” strings and a set of “bad” strings, for a solution string ...
Jens Gramm, Jiong Guo, Rolf Niedermeier
PERCOM
2004
ACM
14 years 8 months ago
A User-Guided Cognitive Agent for Network Service Selection in Pervasive Computing Environments
Connectivity is central to pervasive computing environments. We seek to catalyze a world of rich and diverse connectivity through technologies that drastically simplify the task o...
George Lee, Peyman Faratin, Steven Bauer, John Wro...
ISCAS
2002
IEEE
121views Hardware» more  ISCAS 2002»
14 years 1 months ago
Complex modulated critically sampled filter banks based on cosine and sine modulation
This paper explores subband processing of complex (I/Q) signals which finds various important applications especially in communications signal processing. Instead of using tradit...
Ari Viholainen, Tobias Hidalgo Stitz, Juuso Alhava...
SMA
1997
ACM
152views Solid Modeling» more  SMA 1997»
14 years 1 months ago
Structured Topological Complexes: A Feature-Based API for Non-Manifold Topologies
Much of recent research in representation schemes for solid modeling was focused on the extension of boundary representations to support non-manifold topologies. We introduce here...
Jarek Rossignac
CNSR
2011
IEEE
257views Communications» more  CNSR 2011»
13 years 13 days ago
On Threshold Selection for Principal Component Based Network Anomaly Detection
—Principal component based anomaly detection has emerged as an important statistical tool for network anomaly detection. It works by projecting summary network information onto a...
Petar Djukic, Biswajit Nandy