Sciweavers

160 search results - page 12 / 32
» Highly Scalable Rough Set Reducts Generation
Sort
View
PAIRING
2007
Springer
132views Cryptology» more  PAIRING 2007»
14 years 4 months ago
Instruction Set Extensions for Pairing-Based Cryptography
A series of recent algorithmic advances has delivered highly effective methods for pairing evaluation and parameter generation. However, the resulting multitude of options means m...
Tobias Vejda, Dan Page, Johann Großschä...
FGCN
2008
IEEE
236views Communications» more  FGCN 2008»
14 years 4 months ago
Dimensioning of Next Generation Networks Signaling Gateway for Improving a Quality of Service Target
In this paper, we propose a set of dimensioning rules, which deliver high quality sessionbased services over a Next Generation Network based IP/MPLS transport infrastructure. In p...
Cherif Ghazel, Leila Saidane
ICDM
2006
IEEE
132views Data Mining» more  ICDM 2006»
14 years 3 months ago
High Quality, Efficient Hierarchical Document Clustering Using Closed Interesting Itemsets
High dimensionality remains a significant challenge for document clustering. Recent approaches used frequent itemsets and closed frequent itemsets to reduce dimensionality, and to...
Hassan H. Malik, John R. Kender
SIGGRAPH
1999
ACM
14 years 2 months ago
LCIS: A Boundary Hierarchy for Detail-Preserving Contrast Reduction
High contrast scenes are difficult to depict on low contrast displays without loss of important fine details and textures. Skilled artists preserve these details by drawing scen...
Jack Tumblin, Greg Turk
SIAMJO
2010
100views more  SIAMJO 2010»
13 years 4 months ago
Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions
The sensor network localization, SNL , problem in embedding dimension r, consists of locating the positions of wireless sensors, given only the distances between sensors that are ...
Nathan Krislock, Henry Wolkowicz