Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
632
Decision Combination in Multiple Classifier Systems
- IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, VOL. 16. NO. I. JANUARY 1994
, 1994
"... A multiple classifier system is a powerful solution to difficult pattern recognition problems involving large class sets and noisy input because it allows simultaneous use of arbitrary feature descriptors and classification procedures. Decisions by the classifiers can be represented as rankings of ..."
Abstract
-
Cited by 377 (5 self)
- Add to MetaCart
on the highest rank, the Borda count, and logistic regression are proposed for class set reranking. These methods have been tested in applications on degraded machine-printed characters and words from large lexicons, resulting in substantial improvement in overall correctness.
Fine-Grained Change Impact Analysis for Component-Based Product Families
"... Abstract—Developing software product-lines based on a set of shared components is a proven tactic to enhance reuse, quality, and time to market in producing a portfolio of products. Largescale product families face rapidly increasing maintenance challenges as their evolution can happen both as a res ..."
Abstract
- Add to MetaCart
result of collective domain engineering activities, and as a result of product-specific developments. To make informed decisions about prospective modifications, developers need to estimate what other sections of the system will be affected and need attention, which is known as change impact analysis
Coil sensitivity encoding for fast MRI. In:
- Proceedings of the ISMRM 6th Annual Meeting,
, 1998
"... New theoretical and practical concepts are presented for considerably enhancing the performance of magnetic resonance imaging (MRI) by means of arrays of multiple receiver coils. Sensitivity encoding (SENSE) is based on the fact that receiver sensitivity generally has an encoding effect complementa ..."
Abstract
-
Cited by 193 (3 self)
- Add to MetaCart
complementary to Fourier preparation by linear field gradients. Thus, by using multiple receiver coils in parallel scan time in Fourier imaging can be considerably reduced. The problem of image reconstruction from sensitivity encoded data is formulated in a general fashion and solved for arbitrary coil
Model Reduction Techniques for Computing Approximately Optimal Solutions for Markov Decision Processes
- In Thirteenth Conference on Uncertainty in Artificial Intelligence
, 1997
"... We present a method for solving implicit (factored) Markov decision processes (MDPs) with very large state spaces. We introduce a property of state space partitions which we call ffl-homogeneity. Intuitively, an ffl-homogeneous partition groups together states that behave approximately the sam ..."
Abstract
-
Cited by 62 (8 self)
- Add to MetaCart
We present a method for solving implicit (factored) Markov decision processes (MDPs) with very large state spaces. We introduce a property of state space partitions which we call ffl-homogeneity. Intuitively, an ffl-homogeneous partition groups together states that behave approximately
The Complexity of Counting in Sparse, Regular, and Planar Graphs
- SIAM Journal on Computing
, 1997
"... We show that a number of graph-theoretic counting problems remain NP-hard, indeed #P-complete, in very restricted classes of graphs. In particular, it is shown that the problems of counting matchings, vertex covers, independent sets, and extremal variants of these all remain hard when restricted to ..."
Abstract
-
Cited by 88 (0 self)
- Add to MetaCart
to planar bipartite graphs of bounded degree or regular graphs of constant degree. To achieve these results, a new interpolationbased reduction technique which preserves properties such as constant degree is introduced. In addition, the problem of approximately counting minimum cardinality vertex covers
LOWER BOUNDS FOR DIOPHANTINE APPROXIMATIONS
, 1996
"... We introduce a subexponential algorithm for geometric solving of multivariate polynomial equation systems whose bit complexity depends mainly on intrinsic geometric invariants of the solution set. ¿From this algorithm, we derive a new procedure for the decision of consistency of polynomial equation ..."
Abstract
-
Cited by 70 (26 self)
- Add to MetaCart
We introduce a subexponential algorithm for geometric solving of multivariate polynomial equation systems whose bit complexity depends mainly on intrinsic geometric invariants of the solution set. ¿From this algorithm, we derive a new procedure for the decision of consistency of polynomial equation
Beyond Bloom Filters: From Approximate Membership Checks to Approximate State Machines
- SIGCOMM '06
, 2006
"... Many networking applications require fast state lookups in a concurrent state machine, which tracks the state of a large number of flows simultaneously. We consider the question of how to compactly represent such concurrent state machines. To achieve compactness, we consider data structures for Appr ..."
Abstract
-
Cited by 51 (7 self)
- Add to MetaCart
for Approximate Concurrent State Machines (ACSMs) that can return false positives, false negatives, or a “don’t know” response. We describe three techniques based on Bloom filters and hashing, and evaluate them using both theoretical analysis and simulation. Our analysis leads us to an extremely efficient hashing
Using Abstractions for Decision-Theoretic Planning with Time Constraints
, 1994
"... Recently Markov decision processes and optimal control policies have been applied to the problem of decision-theoretic planning. However, the classical methods for generating optimal policies are highly intractable, requiring explicit enumeration of large state spaces. We explore a method for genera ..."
Abstract
-
Cited by 72 (15 self)
- Add to MetaCart
for generating abstractions that allow approximately optimal policies to be constructed; computational gains are achieved through reduction of the state space. Abstractions are generated by identifying propositions that are “relevant” either through their direct impact on utility, or their influence on actions
Submitted to TRB 2003, Committee on Urban Data and Information Systems, A1D08 Word Count: 6,200
, 2002
"... A new methodology has been developed for collecting fine-grained employee commute origination data from employers in major employment centers. Many U.S. multinational firms have adopted the European Parliament Privacy Directive 95/46/EC, the strictest privacy law to date. The methodology discussed c ..."
Abstract
- Add to MetaCart
A new methodology has been developed for collecting fine-grained employee commute origination data from employers in major employment centers. Many U.S. multinational firms have adopted the European Parliament Privacy Directive 95/46/EC, the strictest privacy law to date. The methodology discussed
Approximate Reducts and Association Rules -- Correspondence and Complexity Results --
, 1999
"... . We consider approximate versions of fundamental notions of theories of rough sets and association rules. We analyze the complexity of searching for ff-reducts, understood as subsets discerning "ff-almost" objects from different decision classes, in decision tables. We present how opt ..."
Abstract
-
Cited by 15 (2 self)
- Add to MetaCart
. We consider approximate versions of fundamental notions of theories of rough sets and association rules. We analyze the complexity of searching for ff-reducts, understood as subsets discerning "ff-almost" objects from different decision classes, in decision tables. We present how
Results 1 - 10
of
632
