Sciweavers

948 search results - page 134 / 190
» What can we achieve by arbitrary announcements
Sort
View
ISQED
2010
IEEE
123views Hardware» more  ISQED 2010»
13 years 10 months ago
Yield-constrained digital circuit sizing via sequential geometric programming
Circuit design under process variation can be formulated mathematically as a robust optimization problem with a yield constraint. Existing methods force designers to either resort...
Yu Ben, Laurent El Ghaoui, Kameshwar Poolla, Costa...
NAACL
2004
13 years 10 months ago
A Statistical Model for Multilingual Entity Detection and Tracking
Entity detection and tracking is a relatively new addition to the repertoire of natural language tasks. In this paper, we present a statistical language-independent framework for ...
Radu Florian, Hany Hassan, Abraham Ittycheriah, Ho...
IAJIT
2008
145views more  IAJIT 2008»
13 years 9 months ago
NAMP: Neighbor Aware Multicast Routing Protocol for Mobile Ad Hoc Networks
: A Mobile Ad Hoc Network (MANET) represents a system of wireless mobile nodes that can freely and dynamically self-organize into arbitrary and temporary network topologies without...
Al-Sakib Khan Pathan, Muhammad Mostafa Monowar, Md...
ITIIS
2010
200views more  ITIIS 2010»
13 years 3 months ago
New Techniques for Anonymous HIBE with Short Ciphertexts in Prime Order Groups
Anonymous hierarchical identity based encryption (HIBE) is an extension of identity based encryption (IBE) that can use an arbitrary string like an e-mail address for a public key...
Kwangsu Lee, Dong Hoon Lee
IMR
2004
Springer
14 years 2 months ago
Entkerner: A System for Removal of Globally Invisible Triangles from Large Meshes
We present a method that computes a global potentially visible set for the complete region outside the convex hull of an object. The technique is used to remove invisible parts (t...
Manfred Ernst, Frank Firsching, Roberto Grosso