2520 search results - page 188 / 504 » The complexity of approximating entropy |
117
click to vote
MOBIHOC
2002
ACM
15 years 10 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
SSD
2005
Springer
15 years 4 months ago
2005
Springer
Abstract. Many new applications involving moving objects require the collection and querying of trajectory data, so efficient indexing methods are needed to support complex spatio...
INFOCOM
2011
IEEE
14 years 2 months ago
2011
IEEE
—Generating a shared key between two parties from the wireless channel is of increasing interest. The procedure for obtaining information from wireless channel is called channel ...
165
click to vote
MSR
2011
ACM
14 years 1 months ago
2011
ACM
Software readability is a property that influences how easily a given piece of code can be read and understood. Since readability can affect maintainability, quality, etc., prog...
100
Voted
ICML
2008
IEEE
15 years 12 months ago
2008
IEEE
While discriminative training (e.g., CRF, structural SVM) holds much promise for machine translation, image segmentation, and clustering, the complex inference these applications ...