CORR 2011 - PDF Preprint Papers

CORR 2011 Workshop on Service Oriented Computing

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed CORR-2011 Paper

click to vote

CORR
2011
Springer

164views Education» more CORR 2011»

Performance Analysis of AODV under Black Hole Attack through Use of OPNET Simulator

1 years 8 days ago

Download www.wcsit.org

— Mobile ad hoc networks (MANETs) are dynamic wireless networks without any infrastructure. These networks are weak against many types of attacks. One of these attacks is the bla...

H. A. Esmaili, M. R. Khalili Shoja, Hossein Gharae...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status
1	164	Performance Analysis of AODV under Black Hole Attack through Use of OPNET Simulator	claim
2	130	Time-Varying Graphs and Social Network Analysis: Temporal Indicators and Metrics	claim
3	109	Digital herders and phase transition in a voting model	claim
4	101	A linear framework for region-based image segmentation and inpainting involving curvature penalization	claim
5	99	Mining User Comment Activity for Detecting Forum Spammers in YouTube	claim
6	96	Combining Ontology Development Methodologies and Semantic Web Platforms for E-government Domain Ontology Development	claim
7	94	Approximating Graphic TSP by Matchings	claim
8	93	Medical Image Denoising using Adaptive Threshold Based on Contourlet Transform	claim
9	87	SafeVchat: Detecting Obscene Content and Misbehaving Users in Online Video Chat Services	claim
10	87	Convex and Network Flow Optimization for Structured Sparsity	claim
11	85	On Isolating Points Using Disks	claim
12	84	Approximation Algorithms for Submodular Multiway Partition	claim
13	84	Automatic Optimization for MapReduce Programs	claim
14	84	Detection of objects in noisy images and site percolation on square lattices	claim
15	83	From Linked Data to Relevant Data -- Time is the Essence	claim
16	82	Human Activity Detection from RGBD Images	claim
17	81	On the Economics of Cloud Markets	claim
18	81	Energy-Latency Tradeoff for In-Network Function Computation in Random Networks	claim
19	81	The Pros and Cons of Compressive Sensing for Wideband Signal Acquisition: Noise Folding vs. Dynamic Range	claim
20	80	Adapting to Non-stationarity with Growing Expert Ensembles	claim
21	80	Introduction to Categories and Categorical Logic	claim
22	79	BitTorrent Swarm Analysis through Automation and Enhanced Logging	claim
23	79	Digraph description of k-interchange technique for optimization over permutations and adaptive algorithm system	claim
24	78	Intelligent Lighting System Using Wireless Sensor Networks	claim
25	78	Mutual Information, Relative Entropy, and Estimation in the Poisson Channel	claim
26	78	Combining Neural Networks for Skin Detection	claim
27	78	Multiplexed Model Predictive Control	claim
28	77	Fuzzy Approach to Critical Bus Ranking under Normal and Line Outage Contingencies	claim
29	77	Natural Language Processing (almost) from Scratch	claim
30	77	High-Energy-First (HEF) Heuristic for Energy-Efficient Target Coverage Problem	claim
31	77	Joint Distributed Access Point Selection and Power Allocation in Cognitive Radio Networks	claim
32	77	Continuous Multiclass Labeling Approaches and Algorithms	claim
33	76	Quire: Lightweight Provenance for Smart Phone Operating Systems	claim
34	76	Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors	claim
35	75	Kron Reduction of Graphs with Applications to Electrical Networks	claim
36	75	The key exchange cryptosystem used with higher order Diophantine equations	claim
37	75	Maximizing Cloud Providers Revenues via Energy Aware Allocation Policies	claim
38	74	Decentralized Constraint Satisfaction	claim
39	74	Reduction of Many-valued into Two-valued Modal Logics	claim
40	74	Computational Rationalization: The Inverse Equilibrium Problem	claim
41	74	Multiple-Source Single-Sink Maximum Flow in Directed Planar Graphs in O(diameternlog(n)) Time	claim
42	73	Capacity of Discrete Molecular Diffusion Channels	claim
43	73	A new ANEW: Evaluation of a word list for sentiment analysis in microblogs	claim
44	73	Generic Trace Logics	claim
45	73	Approaches to Formal Verification of Security Protocols	claim
46	73	Detection of Spatial Changes using Spatial Data Mining	claim
47	73	Path coalitional games	claim
48	73	Simplicial Homology of Random Configurations	claim
49	73	Context-aware Authorization in Highly Dynamic Environments	claim
50	73	Analysis of the User Acceptance for Implementing ISO/IEC 27001:2005 in Turkish Public Organizations	claim
51	72	Matrix Probing and its Conditioning	claim
52	72	Iterative Reweighted Algorithms for Sparse Signal Recovery with Temporally Correlated Source Vectors	claim
53	72	Buffer Sizing for 802.11 Based Networks	claim
54	72	Localization from Incomplete Noisy Distance Measurements	claim
55	72	RDBNorma: - A semi-automated tool for relational database schema normalization up to third normal form	claim
56	72	Trends in Social Media : Persistence and Decay	claim
57	72	K-Median Clustering, Model-Based Compressive Sensing, and Sparse Recovery for Earth Mover Distance	claim
58	72	Fast Linearized Bregman Iteration for Compressive Sensing and Sparse Denoising	claim
59	71	Measuring NUMA effects with the STREAM benchmark	claim
60	71	Automatic Extraction of Open Space Area from High Resolution Urban Satellite Imagery	claim
61	71	Walking on a Graph with a Magnifying Glass	claim
62	71	Using Short Message Service (SMS) to Support Business Continuity	claim
63	71	Pattern matching in Lempel-Ziv compressed strings: fast, simple, and deterministic	claim
64	70	Comparison Latent Semantic and WordNet Approach for Semantic Similarity Calculation	claim
65	70	Large-Scale Collective Entity Matching	claim
66	70	Reversible Region of Non-Interest (RONI) Watermarking for Authentication of DICOM Images	claim
67	70	The existence of k-radius sequences	claim
68	70	Validation Measures in CMMI	claim
69	70	Distributed Estimation and False Data Detection with Application to Power Networks	claim
70	70	A Comparison of Two Human Brain Tumor Segmentation Methods for MRI Data	claim
71	70	Optimized Performance Evaluation of LTE Hard Handover Algorithm with Average RSRP Constraint	claim
72	69	Generalized Filtering Decomposition	claim
73	69	Square root Bound on the Least Power Non-residue using a Sylvester-Vandermonde Determinant	claim
74	69	Aneka Cloud Application Platform and Its Integration with Windows Azure	claim
75	69	The AllDifferent Constraint with Precedences	claim
76	69	Sweeping an oval to a vanishing point	claim
77	69	Reconstruction of Binary Functions and Shapes from Incomplete Frequency Information	claim
78	69	Solving mazes with memristors: a massively-parallel approach	claim
79	69	Enabling Multi-level Trust in Privacy Preserving Data Mining	claim
80	69	A New Sum-Rate Outer Bound for Interference Channels with Three Source-Destination Pairs	claim
81	69	Linear-Time Algorithms for Graphs of Bounded Rankwidth: A Fresh Look Using Game Theory	claim
82	69	Automata and differentiable words	claim
83	69	Reversible Data Hiding Based on Two-level HDWT Coefficient Histograms	claim
84	69	On Paraconsistent Weakening of Intuitionistic Negation	claim
85	69	Social Welfare in One-sided Matching Markets without Money	claim
86	69	Similarity Join Size Estimation using Locality Sensitive Hashing	claim
87	69	Garbage Collection for Multicore NUMA Machines	claim
88	69	Courcelle's Theorem - A Game-Theoretic Approach	claim
89	69	Spatially-Coupled MacKay-Neal Codes and Hsu-Anastasopoulos Codes	claim
90	69	Learning When Training Data are Costly: The Effect of Class Distribution on Tree Induction	claim
91	69	Volatility made observable at last	claim
92	68	DB Category: Denotational Semantics for View-based Database Mappings	claim
93	68	Solving connectivity problems parameterized by treewidth in single exponential time	claim
94	68	A Secure Communication Game with a Relay Helping the Eavesdropper	claim
95	68	Beating the Gilbert-Varshamov Bound for Online Channels	claim
96	68	Course on System Design (structural approach)	claim
97	68	Difference Sequence Compression of Multidimensional Databases	claim
98	68	Robust Additively Coupled Games	claim
99	68	The total path length of split trees	claim
100	68	Image Encryption Based on Diffusion and Multiple Chaotic Maps	claim
101	68	Commutative Algebra of Statistical Ranking	claim
102	68	Cyber-Physical Attacks in Power Networks: Models, Fundamental Limitations and Monitor Design	claim
103	68	Classical and Quantum Annealing in the Median of Three Satisfiability	claim
104	68	Aging in language dynamics	claim
105	68	Computing pseudotriangulations via branched coverings	claim
106	68	A Doubly Exponentially Crumbled Cake	claim
107	68	Glioblastoma Multiforme Segmentation in MRI Data with a Balloon Inflation Approach	claim
108	68	Compound Outage Probability and Capacity of a Class of Fading MIMO Channels with Channel Distribution Uncertainty	claim
109	68	Negative Database for Data Security	claim
110	68	On the Decoding Complexity of Cyclic Codes Up to the BCH Bound	claim
111	68	Interference Channel with State Information	claim
112	67	Open problems in Costas arrays	claim
113	67	Internal stabilization of the Oseen-Stokes equations by Stratonovich noise	claim
114	67	Metamorphic Virus Variants Classification Using Opcode Frequency Histogram	claim
115	67	Generalized Gray Codes for Local Rank Modulation	claim
116	67	An Alternating Direction Algorithm for Matrix Completion with Nonnegative Factors	claim
117	67	A Goal-Directed Implementation of Query Answering for Hybrid MKNF Knowledge Bases	claim
118	67	Parallel Online Learning	claim
119	67	Matched Filtering from Limited Frequency Samples	claim
120	67	An automaton over data words that captures EMSO logic	claim
121	67	Acyclic and Star Colorings of Cographs	claim
122	67	Agent Based Processing of Global Evaluation Function	claim
123	67	Convergence analysis of a proximal Gauss-Newton method	claim
124	67	Performance evaluation of FD-SOI Mosfets for different metal gate work function	claim
125	67	On the regularity of iterated hairpin completion of a single word	claim
126	67	Query Expansion Based on Clustered Results	claim
127	67	Visualization techniques for data mining of Latur district satellite imagery	claim
128	67	Comparative Study on DFD to UML Diagrams Transformations	claim
129	67	Planar Cycle Covering Graphs	claim
130	67	A Formalization of Polytime Functions	claim
131	66	Picturing classical and quantum Bayesian inference	claim
132	66	On Network Coding Capacity - Matroidal Networks and Network Capacity Regions	claim
133	66	Diagonal Based Feature Extraction for Handwritten Alphabets Recognition System using Neural Network	claim
134	66	The Bethe Permanent of a Non-Negative Matrix	claim
135	66	An Automated Size Recognition Technique for Acetabular Implant in Total Hip Replacement	claim
136	66	Aorta Segmentation for Stent Simulation	claim
137	66	Performance Comparison and Analysis of Preemptive-DSR and TORA	claim
138	66	Using Paxos to Build a Scalable, Consistent, and Highly Available Datastore	claim
139	66	An implementation of range trees with fractional cascading in C++	claim
140	66	Theory of Atomata	claim
141	66	On the Semantics of Purpose Requirements in Privacy Policies	claim
142	66	An Empirical Study of Real-World SPARQL Queries	claim
143	66	A family of abstract interpretations for static analysis of concurrent higher-order programs	claim
144	66	Poster Abstract: If You Have Time, Save Energy with Pull	claim
145	66	Active Markov Information-Theoretic Path Planning for Robotic Environmental Sensing	claim
146	66	Statistical Compressed Sensing of Gaussian Mixture Models	claim
147	66	Stationary distribution and cover time of random walks on random digraphs	claim
148	66	Querying and Manipulating Temporal Databases	claim
149	66	Limit Theorems for the Sample Entropy of Hidden Markov Chains	claim
150	66	Context Aware Multisensor Image Fusion for Military Sensor Networks using Multi Agent System	claim
151	66	Ensuring the boundedness of the core of games with restricted cooperation	claim
152	66	From Machine Learning to Machine Reasoning	claim
153	66	Decoding by Embedding: Correct Decoding Radius and DMT Optimality	claim
154	66	The Iterated Prisoner's Dilemma on a Cycle	claim
155	66	Complete Subdivision Algorithms, II: Isotopic Meshing of Singular Algebraic Curves	claim
156	66	A novel super resolution reconstruction of low reoslution images progressively using dct and zonal filter based denoising	claim
157	66	Plug-in Approach to Active Learning	claim
158	66	Convex inner approximations of nonconvex semialgebraic sets applied to fixed-order controller design	claim
159	65	Reconciling Compressive Sampling Systems for Spectrally-sparse Continuous-time Signals	claim
160	65	Octal Bent Generalized Boolean Functions	claim
161	65	Managing and Querying Web Services Communities: A Survey	claim
162	65	Reverse Engineering of Molecular Networks from a Common Combinatorial Approach	claim
163	65	Machine Learning and the Traveling Repairman	claim
164	65	Consensus Problem under Diffusion-based Molecular Communication	claim
165	65	A Broadcast Approach To Secret Key Generation Over Slow Fading Channels	claim
166	65	Finding Shortest Path for Developed Cognitive Map Using Medial Axis	claim
167	65	On Quadratic Programming with a Ratio Objective	claim
168	65	Distributed Inference and Query Processing for RFID Tracking and Monitoring	claim
169	65	Team-building with Answer Set Programming in the Gioia-Tauro Seaport	claim
170	65	A Message-Passing Receiver for BICM-OFDM over Unknown Clustered-Sparse Channels	claim
171	65	T2Script Programming Language	claim
172	65	On the accuracy of language trees	claim
173	65	Possibilities and impossibilities in Kolmogorov complexity extraction	claim
174	65	On Conditions for Linearity of Optimal Estimation	claim
175	65	"Improved FCM algorithm for Clustering on Web Usage Mining"	claim
176	65	Fairness issues in a chain of IEEE 802.11 stations	claim
177	65	On the algebraic numbers computable by some generalized Ehrenfest urns	claim
178	65	Nonuniform Coverage Control on the Line	claim
179	65	Surrogate Parenthood: Protected and Informative Graphs	claim
180	65	Fully Simulatable Quantum-Secure Coin-Flipping and Applications	claim
181	64	Evidence Feed Forward Hidden Markov Model: A New Type of Hidden Markov Model	claim
182	64	Analysis and Improvement of Low Rank Representation for Subspace segmentation	claim
183	64	Search-based software test data generation using evolutionary computation	claim
184	64	An Efficient Method Based on Genetic Algorithms to Solve Sensor Network Optimization Problem	claim
185	64	All Roads Lead To Rome	claim
186	64	Fast Set Intersection in Memory	claim
187	64	Binary and nonbinary description of hypointensity in human brain MR images	claim
188	64	Graffiti Networks: A Subversive, Internet-Scale File Sharing Model	claim
189	64	Statistical Analysis of Link Scheduling on Long Paths	claim
190	64	Difference-Huffman Coding of Multidimensional Databases	claim
191	64	A Game-Theoretic View of the Interference Channel: Impact of Coordination and Bargaining	claim
192	64	Sparse Signal Recovery with Temporally Correlated Source Vectors Using Sparse Bayesian Learning	claim
193	64	Precoding for Outage Probability Minimization on Block Fading Channels	claim
194	64	Geodesics in CAT(0) Cubical Complexes	claim
195	64	Left invertibility of discrete-time output-quantized systems: the linear case with finite inputs	claim
196	64	Finding undetected protein associations in cell signaling by belief propagation	claim
197	64	Helly numbers of acyclic families	claim
198	64	Business Intelligence for Small and Middle-Sized Entreprises	claim
199	64	Linear Dependent Types and Relative Completeness	claim
200	64	Fast Local Computation Algorithms	claim
201	64	Secure Routing in Wireless Mesh Networks	claim
202	64	Multi-skill Collaborative Teams based on Densest Subgraphs	claim
203	64	Primitive words and roots of words	claim
204	64	Contract-Based Cooperative Spectrum Sharing	claim
205	64	Log-Convexity of Rate Region in 802.11e WLANs	claim
206	64	An Adaptive Multimedia-Oriented Handoff Scheme for IEEE 802.11 WLANs	claim
207	64	Fast and Faster: A Comparison of Two Streamed Matrix Decomposition Algorithms	claim
208	63	Recovery of Sparsely Corrupted Signals	claim
209	63	Data Separation by Sparse Representations	claim
210	63	Impact of Limited Feedback on MIMO-OFDM Systems using Joint Beamforming	claim
211	63	Guided Data Repair	claim
212	63	Caching in Multidimensional Databases	claim
213	63	Planning with Partial Preference Models	claim
214	63	Thermal Analysis of Climate Regions using Remote Sensing and Grid Computing	claim
215	63	User Modeling Combining Access Logs, Page Content and Semantics	claim
216	63	Link Spam Detection based on DBSpamClust with Fuzzy C-means Clustering	claim
217	63	Compressed String Dictionaries	claim
218	63	Unfolding network communities by combining defensive and offensive label propagation	claim
219	63	Decentralized Formation Control Part I: Geometric Aspects	claim
220	63	Peer Effects and Stability in Matching Markets	claim
221	63	On Approximating Four Covering and Packing Problems	claim
222	63	Streaming Tree Transducers	claim
223	63	Subexponential convergence for information aggregation on regular trees	claim
224	63	Key Reduction of McEliece's Cryptosystem Using List Decoding	claim
225	63	The Dispersion of Lossy Source Coding	claim
226	63	Asymptotic Enumeration of Non-crossing Partitions on Surfaces	claim
227	63	A Small PRG for Polynomial Threshold Functions of Gaussians	claim
228	62	The decimation process in random k-SAT	claim
229	62	Extracting and Verifying Cryptographic Models from C Protocol Code by Symbolic Execution	claim
230	62	A Truthful Randomized Mechanism for Combinatorial Public Projects via Convex Optimization	claim
231	62	Robust Distributed Routing in Dynamical Flow Networks - Part II: Strong Resilience, Equilibrium Selection and Cascaded Failures	claim
232	62	An Agent Based Architecture (Using Planning) for Dynamic and Semantic Web Services Composition in an EBXML Context	claim
233	62	Convex Approaches to Model Wavelet Sparsity Patterns	claim
234	62	GRASP and path-relinking for Coalition Structure Generation	claim
235	62	A Directional Feature with Energy based Offline Signature Verification Network	claim
236	62	Using Feature Weights to Improve Performance of Neural Networks	claim
237	62	Simulation of Self-Assembly in the Abstract Tile Assembly Model with ISU TAS	claim
238	62	Failure of A Mix Network	claim
239	62	Optimal Pricing in Networks with Externalities	claim
240	62	Exact maximum-likelihood method to detect patterns in real networks	claim
241	62	Connectedness of fractals associated with Arnoux-Rauzy substitutions	claim
242	62	First-order Logic: Modality and Intensionality	claim
243	62	A Primer on Strategic Games	claim
244	62	Proof-Theoretic Soundness and Completeness	claim
245	62	One to Rule Them All: a General Randomized Algorithm for Buffer Management with Bounded Delay	claim
246	62	Generating Probability Distributions using Multivalued Stochastic Relay Circuits	claim
247	62	Adaptively Learning the Crowd Kernel	claim
248	62	Finitely generated free Heyting algebras via Birkhoff duality and coalgebra	claim
249	62	Analysis of multi-stage open shop processing systems	claim
250	62	Approachability of Convex Sets in Games with Partial Monitoring	claim
251	62	Topology Discovery of Sparse Random Graphs With Few Participants	claim
252	62	Degrees of Freedom Region of the Gaussian MIMO Broadcast Channel with Common and Private Messages	claim
253	62	Automatic Network Fingerprinting through Single-Node Motifs	claim
254	61	Exact observability, square functions and spectral theory	claim
255	61	Online Learning of Rested and Restless Bandits	claim
256	61	An Agent-based Strategy for Deploying Analysis Models into Specification and Design for Distributed APS Systems	claim
257	61	Finding Deceptive Opinion Spam by Any Stretch of the Imagination	claim
258	61	An Analysis of Optimal Link Bombs	claim
259	61	A Real-Time Model-Based Reinforcement Learning Architecture for Robot Control	claim
260	61	Improving Strategies via SMT Solving	claim
261	61	Psi-calculi: a framework for mobile processes with nominal data and logic	claim
262	61	Self-Index Based on LZ77	claim
263	61	Context Capture in Software Development	claim
264	61	Multi-objective Optimization For The Dynamic Multi-Pickup and Delivery Problem with Time Windows	claim
265	61	Accelerated Dual Descent for Network Optimization	claim
266	61	Polarized Montagovian Semantics for the Lambek-Grishin calculus	claim
267	61	Global Stability Analysis of Fluid Flows using Sum-of-Squares	claim
268	61	Irreducible triangulations of surfaces with boundary	claim
269	61	Information-Theoretic Viewpoints on Optimal Causal Coding-Decoding Problems	claim
270	61	Improved Approximation Guarantees for Lower-Bounded Facility Location	claim
271	61	Face Recognition using 3D Facial Shape and Color Map Information: Comparison and Combination	claim
272	61	Probability Based Clustering for Document and User Properties	claim
273	61	The AWGN Red Alert Problem	claim
274	61	Gigapixel Binary Sensing: Image Acquisition Using Oversampled One-Bit Poisson Statistics	claim
275	60	Termination Proofs in the Dependency Pair Framework May Induce Multiple Recursive Derivational Complexity	claim
276	60	Lectures on noise sensitivity and percolation	claim
277	60	Study of Throughput and Delay in Finite-Buffer Line Networks	claim
278	60	Synthesizing Systems with Optimal Average-Case Behavior for Ratio Objectives	claim
279	60	The power and Arnoldi methods in an algebra of circulants	claim
280	60	Arrangement Computation for Planar Algebraic Curves	claim
281	60	Cooperative searching for stochastic targets	claim
282	60	Discrete Time Elastic Vector Spaces	claim
283	60	Physical expander in Virtual Tree Overlay	claim
284	60	Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection	claim
285	60	Noisy matrix decomposition via convex relaxation: Optimal rates in high dimensions	claim
286	60	Message Structures: a modelling technique for information systems analysis and design	claim
287	60	Privacy-Enhanced Reputation-Feedback Methods to Reduce Feedback Extortion in Online Auctions	claim
288	60	Special Values of Generalized Log-sine Integrals	claim
289	60	Selfishness, fraternity, and other-regarding preference in spatial evolutionary games	claim
290	60	Impact of link deletions on public cooperation in scale-free networks	claim
291	60	A short proof of the Quantum Substate Theorem	claim
292	60	Programming Massively Parallel Architectures using MARTE: a Case Study	claim
293	60	Sparsity based sub-wavelength imaging with partially incoherent light via quadratic compressed sensing	claim
294	60	Kernels for Global Constraints	claim
295	60	Universal Learning Theory	claim
296	60	Online Least Squares Estimation with Self-Normalized Processes: An Application to Bandit Problems	claim
297	60	The physical Church-Turing thesis and the principles of quantum theory	claim
298	59	ATC Taskload Inherent to the Geometry of Stochastic 4-D Trajectory Flows with Flight Technical Errors	claim
299	59	Multiply-Recursive Upper Bounds with Higman's Lemma	claim
300	59	Bounds on the Capacity of the Relay Channel with Noncausal State at Source	claim
301	59	Percolation in the Secrecy Graph	claim
302	59	Automatic Wrappers for Large Scale Web Extraction	claim
303	59	A Foundational View on Integration Problems	claim
304	59	On a linear programming approach to the discrete Willmore boundary value problem and generalizations	claim
305	59	Composition of Management System for Smart Homes	claim
306	59	Multi-layer Bit-wise Unequal Error Protection for Variable Length Blockcodes with Feedback	claim
307	59	A Factorial Experiment on Scalability of Search Based Software Testing	claim
308	59	Sparsity Enhanced Decision Feedback Equalization	claim
309	59	To Parallelize or Not to Parallelize, Speed Up Issue	claim
310	59	Triangular Dynamic Architecture for Distributed Computing in a LAN Environment	claim
311	59	Abstract Processes of Place/Transition Systems	claim
312	59	Tiled QR factorization algorithms	claim
313	59	The Impact of Memory Models on Software Reliability in Multiprocessors	claim
314	59	Global Search Based on Efficient Diagonal Partitions and a set of Lipschitz Constants	claim
315	59	User guide to TIM, a ray-tracing program for forbidden ray optics	claim
316	59	Image Encryption Using Differential Evolution Approach in Frequency Domain	claim
317	59	Heuristic Algorithm for Interpretation of Non-Atomic Categorical Attributes in Similarity-based Fuzzy Databases - Scalability Evaluation	claim
318	59	Coded Modulation for Power Line Communications	claim
319	59	Optimal Column-Based Low-Rank Matrix Reconstruction	claim
320	59	Reactive Turing Machines	claim
321	59	Symbolic computation of weighted Moore-Penrose inverse using partitioning method	claim
322	59	Traced communication complexity of cellular automata	claim
323	59	Parallel Coordinate Descent for L1-Regularized Loss Minimization	claim
324	59	AWGN Channel Analysis of Terminated LDPC Convolutional Codes	claim
325	59	Tight Bounds for Parallel Randomized Load Balancing	claim
326	59	I Don't Want to Think About it Now:Decision Theory With Costly Computation	claim
327	59	XMLlab : multimedia publication of simulations applets using XML and Scilab	claim
328	59	Analyzing the Impact of Visitors on Page Views with Google Analytics	claim
329	58	Cryptanalysis of three matrix-based key establishment protocols	claim
330	58	HOGWILD!: A Lock-Free Approach to Parallelizing Stochastic Gradient Descent	claim
331	58	Network Estimation and Packet Delivery Prediction for Control over Wireless Mesh Networks	claim
332	58	Inner approximations for polynomial matrix inequalities and robust stability regions	claim
333	58	Submodular Decomposition Framework for Inference in Associative Markov Networks with Global Constraints	claim
334	58	On the Weakenesses of Correlation	claim
335	58	Virtual Machines and Networks - Installation, Performance Study, Advantages and Virtualization Options	claim
336	58	MCA Based Performance Evaluation of Project Selection	claim
337	58	Convergence Analysis of Differential Evolution Variants on Unconstrained Global Optimization Functions	claim
338	58	A Matrix Hyperbolic Cosine Algorithm and Applications	claim
339	58	Extracting Features from Ratings: The Role of Factor Models	claim
340	58	Lower bound for deterministic semantic-incremental branching programs solving GEN	claim
341	58	A Model for Coherent Distributed Memory For Race Condition Detection	claim
342	58	Distribution-Independent Evolvability of Linear Threshold Functions	claim
343	58	Symmetry of information and bounds on nonuniform randomness extraction via Kolmogorov extractors	claim
344	58	Competitive and Deterministic Embeddings of Virtual Networks	claim
345	58	On Properties of the Minimum Entropy Sub-tree to Compute Lower Bounds on the Partition Function	claim
346	58	Random Walk on Directed Dynamic Graphs	claim
347	58	Lower bounds on the obstacle number of graphs	claim
348	58	Link Prediction by De-anonymization: How We Won the Kaggle Social Network Challenge	claim
349	58	Partition Functions of Normal Factor Graphs	claim
350	58	Modeling and Analysis of K-Tier Downlink Heterogeneous Cellular Networks	claim
351	58	Evaluation of Three Vision Based Object Perception Methods for a Mobile Robot	claim
352	58	Design, Implementation and Characterization of a Cooperative Communications System	claim
353	58	Persistent Robotic Tasks: Monitoring and Sweeping in Changing Environments	claim
354	58	Platform for Assessing Strategic Alignment Using Enterprise Architecture: Application to E-Government Process Assessment	claim
355	58	Analytical Classification of Multimedia Index Structures by Using a Partitioning Method-Based Framework	claim
356	58	Establishing Applicability of SSDs to LHC Tier-2 Hardware Configuration	claim
357	58	Quantitative Synthesis for Concurrent Programs	claim
358	58	On the Complexity of Solving a Bivariate Polynomial System	claim
359	58	Towards Unbiased BFS Sampling	claim
360	58	Named Entity Recognition Using Web Document Corpus	claim
361	58	Groups with poly-context-free word problem	claim
362	57	Dual-Tree Fast Gauss Transforms	claim
363	57	Decentralized Supply Chain Formation: A Market Protocol and Competitive Equilibrium Analysis	claim
364	57	Parallel addition in non-standard numeration systems	claim
365	57	SLDs for Visualizing Multicolor Elevation Contour Lines in Geo-Spatial Web Applications	claim
366	57	Visual Localisation of Mobile Devices in an Indoor Environment under Network Delay Conditions	claim
367	57	Weakly Supervised Learning of Foreground-Background Segmentation using Masked RBMs	claim
368	57	Metastability of Logit Dynamics for Coordination Games	claim
369	57	Requirements of Vertical Handoff Mechanism in 4G Wireless Networks	claim
370	57	Uncovering the Temporal Dynamics of Diffusion Networks	claim
371	57	Dynamic Feature Description in Human Action Recognition	claim
372	57	Inter-organizational fault management: Functional and organizational core aspects of management architectures	claim
373	57	Universal Metadata Standard	claim
374	57	Sparsity Equivalence of Anisotropic Decompositions	claim
375	57	How to make the most of a shared meal: plan the last bite first	claim
376	57	CPC: programming with a massive number of lightweight threads	claim
377	57	Analytical Study of Object Components for Distributed and Ubiquitous Computing Environment	claim
378	57	A Logical Method for Policy Enforcement over Evolving Audit Logs	claim
379	57	Broadcast Channels with Delayed Finite-Rate Feedback: Predict or Observe?	claim
380	57	Detecting Separation in Robotic and Sensor Networks	claim
381	57	Symbolic Computation of Recursion Operators for Nonlinear Differential-Difference equations	claim
382	57	Semantic Similarity in a Taxonomy: An Information-Based Measure and its Application to Problems of Ambiguity in Natural Language	claim
383	57	The Synchrosqueezing algorithm: a robust analysis tool for signals with time-varying spectrum	claim
384	57	SqFreeEVAL: An (almost) optimal real-root isolation algorithm	claim
385	57	An Implicit Cover Problem in Wild Population Study	claim
386	57	Decision-Feedback Differential Detection in Impulse-Radio Ultra-Wideband Systems	claim
387	56	Collective response of human populations to large-scale emergencies	claim
388	56	Heterogeneous Cellular Networks with Flexible Cell Association: A Comprehensive Downlink SINR Analysis	claim
389	56	Online Learning: Stochastic and Constrained Adversaries	claim
390	56	Temporal Probabilistic Logic Programs: State and Revision	claim
391	56	The degree structure of Weihrauch-reducibility	claim
392	56	An Achievable Rate Region for the Broadcast Channel with Feedback	claim
393	56	Power Allocation Games in Interference Relay Channels: Existence Analysis of Nash Equilibria	claim
394	56	A Novel Probabilistic Pruning Approach to Speed Up Similarity Queries in Uncertain Databases	claim
395	56	Partially Linear Bayesian Estimation with Application to Sparse Approximations	claim
396	56	Application of Threshold Techniques for Readability Improvement of Jawi Historical Manuscript Images	claim
397	56	Generating and Searching Families of FFT Algorithms	claim
398	56	Impossibility of Succinct Quantum Proofs for Collision-Freeness	claim
399	56	Arrangements of double pseudolines	claim
400	56	On the Decidability of Connectedness Constraints in 2D and 3D Euclidean Spaces	claim
401	56	Program Optimization Based Pointer Analysis and Live Stack-Heap Analysis	claim
402	56	Hide-and-Seek with Directional Sensing	claim
403	56	Backdoors to Tractable Answer-Set Programming	claim
404	56	Doubly Robust Smoothing of Dynamical Processes via Outlier Sparsity Constraints	claim
405	56	Convergence of type-symmetric and cut-balanced consensus seeking systems	claim
406	56	Tuffy: Scaling up Statistical Inference in Markov Logic Networks using an RDBMS	claim
407	56	Power Allocation Based on SEP Minimization in Two-Hop Decode-and-Forward Relay Networks	claim
408	56	Application of Freeman Chain Codes: An Alternative Recognition Technique for Malaysian Car Plates	claim
409	56	The restricted isometry property for time-frequency structured random matrices	claim
410	55	A Fuzzy View on k-Means Based Signal Quantization with Application in Iris Segmentation	claim
411	55	Ergodic Transmission Capacity of Wireless Ad Hoc Networks with Interference Management	claim
412	55	Fast Sparse Matrix-Vector Multiplication on GPUs: Implications for Graph Mining	claim
413	55	Representing First-Order Causal Theories by Logic Programs	claim
414	55	On Parsimonious Explanations for 2-D Tree- and Linearly-Ordered Data	claim
415	55	Tight Bounds on Information Dissemination in Sparse Mobile Networks	claim
416	55	Load Balancing in a Networked Environment through Homogenization	claim
417	55	Boolean Networks Design by Genetic Algorithms	claim
418	55	Status of GDL - GNU Data Language	claim
419	55	Orphan-Free Anisotropic Voronoi Diagrams	claim
420	55	Advice Coins for Classical and Quantum Computation	claim
421	55	Intensionality and Two-steps Interpretations	claim
422	55	Binary Sequent Calculi for Truth-invariance Entailment of Finite Many-valued Logics	claim
423	55	Structured interference-mitigation in two-hop networks	claim
424	55	Liquidsoap: a High-Level Programming Language for Multimedia Streaming	claim
425	55	Linear Error Correcting Codes with Anytime Reliability	claim
426	55	How well can we estimate a sparse vector?	claim
427	55	On the Distribution of the Subset Sum Pseudorandom Number Generator on Elliptic Curves	claim
428	55	Labeling 3D scenes for Personal Assistant Robots	claim
429	55	Schema Redescription in Cellular Automata: Revisiting Emergence in Complex Systems	claim
430	54	Fine Synchronization through UWB TH-PPM Impulse Radios	claim
431	54	Blind Compressed Sensing Over a Structured Union of Subspaces	claim
432	54	A Comparison of Link Layer Attacks on Wireless Sensor Networks	claim
433	54	3-Phase Recognition Approach to Pseudo 3D Building Generation from 2D Floor Plan	claim
434	54	Sound and Complete Query Answering in Intensional P2P Data Integration	claim
435	54	Lipschitz Games	claim
436	54	Accelerated Multiplicative Updates and Hierarchical ALS Algorithms for Nonnegative Matrix Factorization	claim
437	54	Concrete Sentence Spaces for Compositional Distributional Models of Meaning	claim
438	54	Human-Assisted Graph Search: It's Okay to Ask Questions	claim
439	54	Community Detection via Semi-Synchronous Label Propagation Algorithms	claim
440	54	Trust Based Participant Driven Privacy Control in Participatory Sensing	claim
441	54	An Overview of Portable Distributed Techniques	claim
442	54	A Generalized Method for Integrating Rule-based Knowledge into Inductive Methods Through Virtual Sample Creation	claim
443	54	Codeco: A Grammar Notation for Controlled Natural Language in Predictive Editors	claim
444	54	Taking Saratoga from Space-Based Ground Sensors to Ground-Based Space Sensors	claim
445	54	A new approach to nonrepetitive sequences	claim
446	54	Naming Games in Two-Dimensional and Small-World-Connected Random Geometric Networks	claim
447	54	Gossip PCA	claim
448	54	Uniqueness domains and non singular assembly mode changing trajectories	claim
449	54	Type Classes for Mathematics in Type Theory	claim
450	54	Rational Deployment of CSP Heuristics	claim
451	54	Optimal Channel Training in Uplink Network MIMO Systems	claim
452	54	Spatially Coupled Codes over the Multiple Access Channel	claim
453	54	Better Bounds for Incremental Frequency Allocation in Bipartite Graphs	claim
454	54	Treatment of Semantic Heterogeneity in Information Retrieval	claim
455	54	Arc-preserving subsequences of arc-annotated sequences	claim
456	54	Asymptotic Moments for Interference Mitigation in Correlated Fading Channels	claim
457	54	PHCpack in Macaulay2	claim
458	54	Adaptive Channel Recommendation for Dynamic Spectrum Access	claim
459	54	Short-Message Quantize-Forward Network Coding	claim
460	54	High Degree Vertices, Eigenvalues and Diameter of Random Apollonian Networks	claim
461	54	Refined bounds on the number of connected components of sign conditions on a variety	claim
462	54	Interactive Execution Monitoring of Agent Teams	claim
463	54	From IF to BI: a tale of dependence and separation	claim
464	53	The Rate of Convergence of AdaBoost	claim
465	53	Compositional Model Repositories via Dynamic Constraint Satisfaction with Order-of-Magnitude Preferences	claim
466	53	Additive Pattern Database Heuristics	claim
467	53	A New Localized Network Based Routing Model in Computer and Communication networks	claim
468	53	Synthesizing Switching Logic to Minimize Long-Run Cost	claim
469	53	Sparse approximation property and stable recovery of sparse signals from noisy measurements	claim
470	53	Model based system engineering approach of a lightweight embedded TCP/IP	claim
471	53	A hybrid model for bankruptcy prediction using genetic algorithm, fuzzy c-means and mars	claim
472	53	Distributed Private Data Analysis: On Simultaneously Solving How and What	claim
473	53	High-Throughput Transaction Executions on Graphics Processors	claim
474	53	Applying Science Models for Search	claim
475	53	Finitary languages	claim
476	53	Anytime Reliable Codes for Stabilizing Plants over Erasure Channels	claim
477	53	Handwritten Digit Recognition with a Committee of Deep Neural Nets on GPUs	claim
478	53	Robust Line Planning in case of Multiple Pools and Disruptions	claim
479	53	Extensional Collapse Situations I: non-termination and unrecoverable errors	claim
480	53	Coloring Planar Homothets and Three-Dimensional Hypergraphs	claim
481	53	Causal Dependence Tree Approximations of Joint Distributions for Multiple Random Processes	claim
482	53	Analysis of Web Logs and Web User in Web Mining	claim
483	53	Semantic Interlinking of Resources in the Virtual Observatory Era	claim
484	53	On the Zero-Error Capacity Threshold for Deletion Channels	claim
485	53	Load-Balancing Spatially Located Computations using Rectangular Partitions	claim
486	53	Pattern discovery for semi-structured web pages using bar-tree representation	claim
487	53	CoPhy: A Scalable, Portable, and Interactive Index Advisor for Large Workloads	claim
488	53	Parallel Performance of MPI Sorting Algorithms on Dual-Core Processor Windows-Based Systems	claim
489	53	Solving k-Set Agreement with Stable Skeleton Graphs	claim
490	53	A Family of Adaptive Filter Algorithms in Noise Cancellation for Speech Enhancement	claim
491	53	Maximum Metric Spanning Tree made Byzantine Tolerant	claim
492	53	Comparing Haar-Hilbert and Log-Gabor Based Iris Encoders on Bath Iris Image Database	claim
493	53	On minimising automata with errors	claim
494	53	Dominating Manipulations in Voting with Partial Information	claim
495	52	Ensuring Correctness at the Application Level: a Software Framework Approach	claim
496	52	A Personalized System for Conversational Recommendations	claim
497	52	Lift-and-Project Integrality Gaps for the Traveling Salesperson Problem	claim
498	52	Fast global convergence of gradient methods for high-dimensional statistical recovery	claim
499	52	The Language Features and Architecture of B-Prolog	claim
500	52	Many collinear k-tuples with no k+1 collinear points	claim
501	52	Neural network to identify individuals at health risk	claim
502	52	The Identity Crisis. Security, Privacy and Usability Issues in Identity Management	claim
503	52	Convex Polyhedra Realizing Given Face Areas	claim
504	52	MDS Array Codes with Optimal Rebuilding	claim
505	52	Redundancy of minimal weight expansions in Pisot bases	claim
506	52	Intelligent Semantic Web Search Engines: A Brief Survey	claim
507	52	On the resilience of Hamiltonicity and optimal packing of Hamilton cycles in random graphs	claim
508	52	Multimedia Database Applications: Issues and Concerns for Classroom Teaching	claim
509	52	Efficient Maximum Likelihood Estimation of a 2-D Complex Sinusoidal Based on Barycentric Interpolation	claim
510	52	Clustering Partially Observed Graphs via Convex Optimization	claim
511	52	A Class of Probabilistic Automata with a Decidable Value 1 Problem	claim
512	52	Comparing webometric with web-independent rankings: a case study with German universities	claim
513	52	Common Edge-Unzippings for Tetrahedra	claim
514	52	Rank Minimization over Finite Fields: Fundamental Limits and Coding-Theoretic Interpretations	claim
515	52	EMBANKS: Towards Disk Based Algorithms For Keyword-Search In Structured Databases	claim
516	52	On Reachability for Hybrid Automata over Bounded Time	claim
517	52	Large-Scale Convex Minimization with a Low-Rank Constraint	claim
518	52	Mean-Variance Optimization in Markov Decision Processes	claim
519	52	On the Windfall and Price of Friendship: Inoculation Strategies on Social Networks	claim
520	52	On the number of maximal independent sets in a graph	claim
521	52	Message and State Cooperation in a Relay Channel When the Relay Has Strictly Causal State Information	claim
522	52	Fundamentals of Inter-cell Overhead Signaling in Heterogeneous Cellular Networks	claim
523	51	A Survey of User-Centric Data Warehouses: From Personalization to Recommendation	claim
524	51	Data Base Mappings and Theory of Sketches	claim
525	51	The Development of Electronic Payment System for Universities in Indonesia: On Resolving Key Success Factors	claim
526	51	A Science Model Driven Retrieval Prototype	claim
527	51	LIFO-search on digraphs: A searching game for cycle-rank	claim
528	51	A low-memory algorithm for finding short product representations in finite groups	claim
529	51	Cooperative Defense Against Pollution Attacks in Network Coding Using SpaceMac	claim
530	51	Dimensional behaviour of entropy and information	claim
531	51	On cooperative patrolling: optimal trajectories, complexity analysis, and approximation algorithms	claim
532	51	U-Sem: Semantic Enrichment, User Modeling and Mining of Usage Data on the Social Web	claim
533	51	Orthogonal Range Searching on the RAM, Revisited	claim
534	51	Total variation regularization for fMRI-based prediction of behaviour	claim
535	51	Improve performance of tcp new reno over mobile ad-hoc network using abra	claim
536	51	On Social-Temporal Group Query with Acquaintance Constraint	claim
537	51	Exploiting Conceptual Knowledge for Querying Information Systems	claim
538	51	Coarse-Grained Topology Estimation via Graph Sampling	claim
539	51	Design of Transport Layer Based Hybrid Covert Channel Detection Engine	claim
540	51	Chameleon: A Color-Adaptive Web Browser for Mobile OLED Displays	claim
541	51	A new bound for parsimonious edge-colouring of graphs with maximum degree three	claim
542	51	Geometric Semigroup Theory	claim
543	51	Resource CoAllocation for Scheduling Tasks with Dependencies, in Grid	claim
544	50	Knowledge Management System Design using Extended Gaia	claim
545	50	Minimizing the sum of many rational functions	claim
546	50	Cost effective approach on feature selection using genetic algorithms and fuzzy logic for diabetes diagnosis	claim
547	50	Experimenting with Transitive Verbs in a DisCoCat	claim
548	50	Decision Support Tools for Cloud Migration in the Enterprise	claim
549	50	A Self-Organized Resource Allocation using Inter-Cell Interference Coordination (ICIC) in Relay-Assisted Cellular Networks	claim
550	50	Provenance for Aggregate Queries	claim
551	50	Strict Authentication Watermarking with JPEG Compression (SAW-JPEG) for Medical Images	claim
552	50	An Overview of the Security Concerns in Enterprise Cloud Computing	claim
553	50	Blind source separation of convolutive mixtures of non circular linearly modulated signals with unknown baud rates	claim
554	50	Sequential Analysis in High Dimensional Multiple Testing and Sparse Recovery	claim
555	50	Pattern tree-based XOLAP rollup operator for XML complex hierarchies	claim
556	50	A Universal Part-of-Speech Tagset	claim
557	50	Securing The Kernel via Static Binary Rewriting and Program Shepherding	claim
558	50	On Stabilization in Herman's Algorithm	claim
559	50	General Iteration graphs and Boolean automata circuits	claim
560	50	Collective Animal Behavior from Bayesian Estimation and Probability Matching	claim
561	50	Upper Bounds for Maximally Greedy Binary Search Trees	claim
562	50	Lightweight Service Oriented Architecture for Pervasive Computing	claim
563	50	An overview of Ciao and its design philosophy	claim
564	50	U-Learning Within A Context-Aware Multiagent Environment	claim
565	49	Adaptive Cluster Expansion for Inferring Boltzmann Machines with Noisy Data	claim
566	49	Robust Distributed Routing in Dynamical Flow Networks	claim
567	49	An Autonomous Long Range Monitoring System For Emergency Operators	claim
568	49	Ecosystem Viable Yields	claim
569	49	Noise Folding in Compressed Sensing	claim
570	49	Approximating minimum-power edge-multicovers	claim
571	49	Deterministic Network Model Revisited: An Algebraic Network Coding Approach	claim
572	49	Isomorphism of regular trees and words	claim
573	49	A Panorama on Multiscale Geometric Representations, Intertwining Spatial, Directional and Frequency Selectivity	claim
574	49	A Modular Type-checking algorithm for Type Theory with Singleton Types and Proof Irrelevance	claim
575	49	Tight Upper Bounds for Streett and Parity Complementation	claim
576	49	On joint triangulations of two sets of points in the plane	claim
577	49	From joint convexity of quantum relative entropy to a concavity theorem of Lieb	claim
578	49	Series Expansion for Interference in Wireless Networks	claim
579	49	Rewriting Ontological Queries into Small Nonrecursive Datalog Programs	claim
580	49	Improving the character recognition efficiency of feed forward BP neural network	claim
581	48	Robust Matrix Completion with Corrupted Columns	claim
582	48	Concurrent Auctions Across The Supply Chain	claim
583	48	A Gentle Introduction to the Kernel Distance	claim
584	48	Lower Bound for Envy-Free and Truthful Makespan Approximation on Related Machines	claim
585	48	The Extraordinary SVD	claim
586	48	Signal Processing in Large Systems: a New Paradigm	claim
587	48	Axiomatic Attribution for Multilinear Functions	claim
588	48	On the set of imputations induced by the k-additive core	claim
589	48	Optimal Power Cost Management Using Stored Energy in Data Centers	claim
590	48	Modeling the pairwise key distribution scheme in the presence of unreliable links	claim
591	48	Maximum Gain Round Trips with Cost Constraints	claim
592	48	Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance	claim
593	48	How to Play Unique Games against a Semi-Random Adversary	claim
594	48	Decision-Theoretic Planning: Structural Assumptions and Computational Leverage	claim
595	48	Polynomial Estimators for High Frequency Moments	claim
596	48	Compiling Causal Theories to Successor State Axioms and STRIPS-Like Systems	claim
597	48	Power Allocation in Team Jamming Games in Wireless Ad Hoc Networks	claim
598	47	A New Data Layout For Set Intersection on GPUs	claim
599	47	An improvement of the Moser-Tardos algorithmic local lemma	claim
600	47	Searching for Bayesian Network Structures in the Space of Restricted Acyclic Partially Directed Graphs	claim
601	47	Interdisciplinary Collaboration through Designing 3D Simulation Case Studies	claim
602	47	A Light Weight Protocol to Provide Location Privacy in Wireless Body Area networks	claim
603	47	WiMAX Based 60 GHz Millimeter-Wave Communication for Intelligent Transport System Applications	claim
604	47	Sampling-rate-aware noise generation	claim
605	47	When is social computation better than the sum of its parts?	claim
606	47	Dueling Algorithms	claim
607	47	Exploiting symmetries in SDP-relaxations for polynomial optimization	claim
608	47	Rank Aggregation via Nuclear Norm Minimization	claim
609	47	A Stochastic-Geometry Approach to Coverage in Cellular Networks with Multi-Cell Cooperation	claim
610	47	A Simulation Experiment on a Built-In Self Test Equipped with Pseudorandom Test Pattern Generator and Multi-Input Shift Register (MISR)	claim
611	47	Computing Optimal Coverability Costs in Priced Timed Petri Nets	claim
612	47	Multicriteria Steiner Tree Problem for Communication Network	claim
613	47	STiCMAC: A MAC Protocol for Robust Space-Time Coding in Cooperative Wireless LANs	claim
614	47	Scalable constructions of fractional repetition codes in distributed storage systems	claim
615	47	A supervised clustering approach for fMRI-based inference of brain states	claim
616	47	Transmission with Energy Harvesting Nodes in Fading Wireless Channels: Optimal Policies	claim
617	47	Parameter Learning of Logic Programs for Symbolic-Statistical Modeling	claim
618	47	On the Locality of Codeword Symbols	claim
619	47	Order Optimal Information Spreading Using Algebraic Gossip	claim
620	47	Is a probabilistic modeling	claim
621	46	Algorithms for Implicit Hitting Set Problems	claim
622	46	Pseudo-random graphs and bit probe schemes with one-sided error	claim
623	46	Online Strategies for Intra and Inter Provider Service Migration in Virtual Networks	claim
624	46	Distributed SIR-Aware Scheduling in Large-Scale Wireless Networks	claim
625	46	Ubiquitous Mobile Health Monitoring System for Elderly (UMHMSE)	claim
626	46	Maximizing Strength of Digital Watermarks using Fuzzy Logic	claim
627	46	Existential witness extraction in classical realizability and via a negative translation	claim
628	46	Close the Gaps: A Learning-while-Doing Algorithm for a Class of Single-Product Revenue Management Problems	claim
629	46	Parallel Recursive State Compression for Free	claim
630	46	A family of fast-decodable MIDO codes from crossed-product algebras over Q	claim
631	46	Mining Target-Oriented Fuzzy Correlation Rules to Optimize Telecom Service Management	claim
632	46	Doubly Robust Policy Evaluation and Learning	claim
633	46	Performance of Hybrid Concatenated Trellis Codes CPFSK with Iterative Decoding over Fading Channels	claim
634	46	Ice-Creams and Wedge Graphs	claim
635	46	The Degree Sequence of Random Apollonian Networks	claim
636	45	A Study of Language Usage Evolution in Open Source Software	claim
637	45	Stage Staffing Scheme for Copyright Protection in Multimedia	claim
638	45	Polynomial kernels for Proper Interval Completion and related problems	claim
639	45	Context-Capture Multi-Valued Decision Fusion With Fault Tolerant Capability For Wireless Sensor Networks	claim
640	45	Nearest Neighbour Decoding and Pilot-Aided Channel Estimation in Stationary Gaussian Flat-Fading Channels	claim
641	45	Realization theory of discrete-time linear switched systems	claim
642	45	Cryptanalysis And Further Improvement Of A Biometric-Based Remote User Authentication Scheme Using Smart Cards	claim
643	45	Performance of Short-Commit in Extreme Database Environment	claim
644	45	Computability of simple games: A complete investigation of the sixty-four possibilities	claim
645	45	Eliciting Forecasts from Self-interested Experts: Scoring Rules for Decision Makers	claim
646	45	Degree Fluctuations and the Convergence Time of Consensus Algorithms	claim
647	45	Exploratory simulation of an Intelligent Iris Verifier Distributed System	claim
648	44	Towards Understanding and Harnessing the Potential of Clause Learning	claim
649	44	Optimal channel allocation with dynamic power control in cellular networks	claim
650	44	GPS Signal Acquisition via Compressive Multichannel Sampling	claim
651	44	Thin Client Web-Based Campus Information Systems for Fiji National University	claim
652	44	A Discrete Choquet Integral for Ordered Systems	claim
653	44	Algorithmic tests and randomness with respect to a class of measures	claim
654	44	Homology and Robustness of Level and Interlevel Sets	claim
655	44	Downlink SDMA with Limited Feedback in Interference-Limited Wireless Networks	claim
656	44	An Algorithm for Odd Gracefulness of the Tensor Product of Two Line Graphs	claim
657	44	Suboptimal Solution Path Algorithm for Support Vector Machine	claim
658	44	Optimal coding for the deletion channel with small deletion probability	claim
659	44	Translation of Pronominal Anaphora between English and Spanish: Discrepancies and Evaluation	claim
660	44	Using Planetlab to Implement Multicast at the Application Level	claim
661	43	Robustness and modular structure in networks	claim
662	43	Decentralized Online Learning Algorithms for Opportunistic Spectrum Access	claim
663	43	Repetitive Reduction Patterns in Lambda Calculus with letrec (Work in Progress)	claim
664	43	Spatially-Aware Comparison and Consensus for Clusterings	claim
665	43	The weak password problem: chaos, criticality, and encrypted p-CAPTCHAs	claim
666	43	Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Quadratic Integer Programming with PSD Objectives	claim
667	43	Re-thinking Enrolment in Identity Card Schemes	claim
668	43	Accelerating Reinforcement Learning through Implicit Imitation	claim
669	43	Ontology based approach for video transmission over the network	claim
670	42	Reinforcement Learning for Agents with Many Sensors and Actuators Acting in Categorizable Environments	claim
671	42	A Robust Mechanism for Defending Distributed Denial OF Service Attacks on Web Servers	claim
672	42	A Human-Centric Approach to Group-Based Context-Awareness	claim
673	42	Convex Hull of Imprecise Points in o(n \log{n}) Time after Preprocessing	claim
674	42	Stability Analysis of Transportation Networks with Multiscale Driver Decisions	claim
675	42	Performance of MC-MC CDMA Systems with Nonlinear Models of HPA	claim
676	42	On the Generation of Positivstellensatz Witnesses in Degenerate Cases	claim
677	42	Multiscale Geometric Methods for Data Sets II: Geometric Wavelets	claim
678	42	The Theory of Intervention Games for Resource Sharing in Wireless Communications	claim
679	41	On the evolution of the instance level of DL-lite knowledge bases	claim
680	41	A Machine Learning Based Analytical Framework for Semantic Annotation Requirements	claim
681	41	How Unique and Traceable are Usernames?	claim
682	41	A Dynamic Multimedia User-Weight Classification Scheme for IEEE_802.11 WLANs	claim
683	41	Numerical solution of a fuzzy time-optimal control problem	claim
684	41	A Review of Interference Reduction in Wireless Networks Using Graph Coloring Methods	claim
685	41	Bias-Driven Revision of Logical Domain Theories	claim
686	41	Design and Analysis of SD_DWCA - A Mobility based clustering of Homogeneous MANETs	claim
687	40	Asymptotic Analysis of Double-Scattering Channels	claim
688	40	Almost Settling the Hardness of Noncommutative Determinant	claim
689	40	An Upper Bound for Signal Transmission Error Probability in Hyperbolic Spaces	claim
690	40	Colorful Triangle Counting and a MapReduce Implementation	claim
691	40	Generalized Boosting Algorithms for Convex Optimization	claim
692	39	Analyzing Walksat on random formulas	claim
693	39	Semantic Inference using Chemogenomics Data for Drug Discovery	claim
694	39	The Nakamura numbers for computable simple games	claim
695	39	SAT-Based Termination Analysis Using Monotonicity Constraints over the Integers	claim
696	39	Analytical Evaluation of Fractional Frequency Reuse for OFDMA Cellular Networks	claim
697	38	Exploring New Directions in Iris Recognition	claim
698	38	SmartInt: Using Mined Attribute Dependencies to Integrate Fragmented Web Databases	claim
699	38	Non-malleable extractors via character sums	claim
700	38	Performance Comparisons of Routing Protocols in Mobile Ad Hoc Networks	claim
701	38	A Wiki for Business Rules in Open Vocabulary, Executable English	claim
702	38	Fast Impulse Noise Removal from Highly Corrupted Images	claim
703	38	Popular Ensemble Methods: An Empirical Study	claim
704	37	Taming Numbers and Durations in the Model Checking Integrated Planning System	claim
705	37	A New Representation Theorem for Many-valued Modal Logics	claim
706	37	Probabilistic Logic: Many-valuedness and Intensionality	claim
707	37	On the Limitations of Provenance for Queries With Difference	claim
708	37	New Polynomial Classes for Logic-Based Abduction	claim
709	36	Quadratic Goldreich-Levin Theorems	claim
710	36	Chameleons in imagined conversations: A new approach to understanding coordination of linguistic style in dialogs	claim
711	36	Sub-Nyquist Sampling: Bridging Theory and Practice	claim
712	36	Minimum k-way cut of bounded size is fixed-parameter tractable	claim
713	35	Web services synchronization health care application	claim
714	35	OSPF Weight Setting Optimization for Single Link Failures	claim
715	34	A Novel Image Segmentation Enhancement Technique based on Active Contour and Topological Alignments	claim
716	34	Volatility of Power Grids under Real-Time Pricing	claim
717	34	Tensor Rank: Some Lower and Upper Bounds	claim
718	33	Evaluation Codes from smooth Quadric Surfaces and Twisted Segre Varieties	claim
719	32	Replication Attack Mitigations for Static and Mobile WSN	claim
720	31	Use of Devolved Controllers in Data Center Networks	claim
721	30	An Extended Framework for Measuring the Information Capacity of the Human Motor System	claim
722	30	Transformation from Identity Stone Age to Digital Identity	claim
723	29	Impact of the Optimum Routing and	claim
724	29	A QoS Routing Protocol based on Available Bandwidth Estimation for Wireless Ad Hoc Networks	claim
725	28	A Weakest Chain Approach to Assessing the Overall Effectiveness of the 802.11 Wireless Network Security	claim
726	27	Augmenting Tractable Fragments of Abstract Argumentation	claim
727	27	PKI in Government Identity Management Systems	claim
728	24	TCP Relentless Congestion Control Model	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers