Sciweavers

2526 search results - page 453 / 506
» A New Algorithm for Answer Set Computation
Sort
View
SDM
2009
SIAM
105views Data Mining» more  SDM 2009»
14 years 5 months ago
Exploiting Semantic Constraints for Estimating Supersenses with CRFs.
The annotation of words and phrases by ontology concepts is extremely helpful for semantic interpretation. However many ontologies, e.g. WordNet, are too fine-grained and even hu...
Gerhard Paaß, Frank Reichartz
COCO
2009
Springer
128views Algorithms» more  COCO 2009»
14 years 2 months ago
An Almost Optimal Rank Bound for Depth-3 Identities
—We show that the rank of a depth-3 circuit (over any field) that is simple, minimal and zero is at most O(k3 log d). The previous best rank bound known was 2O(k2 ) (log d)k−2...
Nitin Saxena, C. Seshadhri
ICDM
2007
IEEE
136views Data Mining» more  ICDM 2007»
14 years 2 months ago
Dynamic Micro Targeting: Fitness-Based Approach to Predicting Individual Preferences
It is crucial to segment customers intelligently in order to offer more targeted and personalized products and services. Traditionally, customer segmentation is achieved using sta...
Tianyi Jiang, Alexander Tuzhilin
ICNP
2005
IEEE
14 years 1 months ago
Efficient Hop ID based Routing for Sparse Ad Hoc Networks
Routing in mobile ad hoc networks remains as a challenging problem given the limited wireless bandwidth, users’ mobility and potentially large scale. Recently, there has been a ...
Yao Zhao, Bo Li, Qian Zhang, Yan Chen, Wenwu Zhu
RTCSA
2005
IEEE
14 years 1 months ago
FPGA-Based Content Protection System for Embedded Consumer Electronics
We propose a new architecture for a content protection system that conceals confidential data and algorithms in an FPGA as electrical circuits. This architecture is designed for a...
Hiroyuki Yokoyama, Kenji Toda