Search results for "LET"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
75	Dorin Let, Bogdan Ionut Tene, Adela-Gabriela Husu, Mihai-Florin Stan, Laurentiu Marian Stancu, Andreea Let	Feasibility of a micro grid scale up at campus level - Case study.	ECAI	2019	DBLP DOI BibTeX RDF
44	Ramón Alonso	A Starting Method for the Three-Point Adams Predictor-Corrector Method.	J. ACM	1960	DBLP DOI BibTeX RDF
37	S. Ayyasamy, Chandran Benin Pratap, Shine Let Gunamony, Rekha Shanmugam	Investigations on ACS-Fed Wearable Antenna With Frequency Reconfiguration Between n78 and WLAN Band.	Wirel. Pers. Commun.	2024	DBLP DOI BibTeX RDF
37	Jeevitha Joseph, Gunamony Shine Let, Chandran Benin Pratap, J. Jenkin Winston	A miniaturized uniplanar MIMO antenna for n79/n46/millimeter-wave applications.	Int. J. Commun. Syst.	2023	DBLP DOI BibTeX RDF
37	Andrew D. Mitchell, Dominic Let, Lingxi Tang	AI Regulation and the Protection of Source Code.	Int. J. Law Inf. Technol.	2023	DBLP DOI BibTeX RDF
37	G. Shine Let, C. Benin Pratap, D. J. Jagannath, D. Raveena Judie Dolly, L. Diana Evangeline	Software-Defined Networking Routing Algorithms: Issues, QoS and Models.	Wirel. Pers. Commun.	2023	DBLP DOI BibTeX RDF
37	Jing-Ming Guo, S. Sankarasrinivasan, Let Viet Hung, Wei Liu	Deep Residual and Classified Neural Networks for Inverse Halftoning.	APSIPA ASC	2023	DBLP DOI BibTeX RDF
37	D. J. Jagannath, D. Raveena Judie Dolly, Gunamony Shine Let, James Dinesh Peter	An IoT enabled smart healthcare system using deep reinforcement learning.	Concurr. Comput. Pract. Exp.	2022	DBLP DOI BibTeX RDF
37	Shine Let Gunamony, G. Josemin Bala, S. Merlin Gilbert Raj, C. Benin Pratap	Asymmetric coplanar strip-fed electrically small reconfigurable 5G mid-band antenna.	Int. J. Commun. Syst.	2021	DBLP DOI BibTeX RDF
37	Vít Listík, Simon Let, Jan Sedivý, Václav Hlavác	Phishing Email Detection based on Named Entity Recognition.	ICISSP	2019	DBLP DOI BibTeX RDF
37	G. Shine Let, G. Josemin Bala	A Review of Cross-layer Design in Dynamic Spectrum Access for Cognitive Radio Networks.	J. Comput. Inf. Technol.	2014	DBLP DOI BibTeX RDF
37	P. K. K. Loh, D. Y. H. Let	A cost-effective space sensing prototype for an intelligent refrigerator.	ICARCV	2004	DBLP DOI BibTeX RDF
32	Emilia Farcas, Claudiu Farcas, Wolfgang Pree, Josef Templ	Transparent distribution of real-time components based on logical execution time.	LCTES	2005	DBLP DOI BibTeX RDF	LET, MoDECS, TDL, logical execution time, timing definition language, embedded systems, real-time, distribution, transparent, component model
31	Vipula Singh, Navin Rajpal, K. Srikanta Murthy	Neuro-Wavelet Based Approach for Image Compression.	CGIV	2007	DBLP DOI BibTeX RDF	Wave let transform, Sub band image decomposition, Neural network, image compression
31	Ik-Soon Kim, Kwangkeun Yi, Cristiano Calcagno	A polymorphic modal type system for lisp-like multi-staged languages.	POPL	2006	DBLP DOI BibTeX RDF	let-polymorphism, modal types, multi-staged languages, polymorphic types, quasi-quotation, record type, type systems, lisp, ML, scheme, type inference
29	Colin Cooper, Alan M. Frieze	The cover time of random geometric graphs.	SODA	2009	DBLP DOI BibTeX RDF
29	Francisco Javier López-Fraguas, Juan Rodríguez-Hortalá, Jaime Sánchez-Hernández	Narrowing for First Order Functional Logic Programs with Call-Time Choice Semantics.	INAP/WLP	2007	DBLP DOI BibTeX RDF
29	Biing-Feng Wang	Finding r-Dominating Sets and p-Centers of Trees in Parallel.	IEEE Trans. Parallel Distributed Syst.	2004	DBLP DOI BibTeX RDF
28	Thierry Blu, Florian Luisier	The SURE-LET Approach to Image Denoising.	IEEE Trans. Image Process.	2007	DBLP DOI BibTeX RDF
26	Joseph Lau	(Let's) playing by the rules: A choice of law rule for communication of copyright material from video games to the public, through Let's Plays.	Comput. Law Secur. Rev.	2023	DBLP DOI BibTeX RDF
26	Sabine R. Bakker, Paul H. J. Hendriks, Hubert P. L. M. Korzilius	Let it go or let it grow? - Personal network development and the mobilization of intra-organizational social capital.	Soc. Networks	2022	DBLP DOI BibTeX RDF
26	Tianxiang Dai, Haya Schulmann, Michael Waidner	Let's Downgrade Let's Encrypt.	CCS	2021	DBLP DOI BibTeX RDF
26	Esra Bozgeyik	Bioinformatic Analysis and in Vitro Validation of Let-7b and Let-7c in Breast Cancer.	Comput. Biol. Chem.	2020	DBLP DOI BibTeX RDF
26	Ted Bergstrom, Rodney Garratt, Greg Leo	Let me, or let George? Motives of competing altruists.	Games Econ. Behav.	2019	DBLP DOI BibTeX RDF
26	Diana Arellano, Cristina Manresa-Yee, Volker Helzle	Let me Listen to Poetry, Let me See Emotions.	J. Univers. Comput. Sci.	2014	DBLP DOI BibTeX RDF
26	Patrizio Dazzi	Let's Annotate to Let Our Code Run in Parallel.	CoRR	2013	DBLP BibTeX RDF
26	Gerry Stahl, Friedrich W. Hesse	Let a hundred flowers bloom; let a hundred schools of thought contend.	Int. J. Comput. Support. Collab. Learn.	2011	DBLP DOI BibTeX RDF
24	Konstantinos Panagiotou, Angelika Steger	Maximal biconnected subgraphs of random planar graphs.	SODA	2009	DBLP DOI BibTeX RDF
24	Enrico Nardelli, Guido Proietti, Peter Widmayer	Swapping a Failing Edge of a Single Source Shortest Paths Tree Is Good and Fast.	Algorithmica	2003	DBLP DOI BibTeX RDF
24	Zhiwei Wang, R. Brien Maguire	A Theory and Approach to Improving Relevance Ranking in Web Retrieval.	Web Intelligence	2001	DBLP DOI BibTeX RDF
24	Tibor Jordán	Edge-Splitting Problems with Demands.	IPCO	1999	DBLP DOI BibTeX RDF
24	Paris C. Kanellakis, Gerd G. Hillebrand, Harry G. Mairson	An Analysis of the Core-ML Language: Expressive Power and Type Reconstruction.	ICALP	1994	DBLP DOI BibTeX RDF
24	Edward K. Blum, Philip C. Curtis Jr.	Asymptotic Behavior of the Best Polynomial Approximation.	J. ACM	1961	DBLP DOI BibTeX RDF
23	Dimitrios Vytiniotis, Simon L. Peyton Jones, Tom Schrijvers	Let should not be generalized.	TLDI	2010	DBLP DOI BibTeX RDF	type families, haskell, type inference, type classes, generalized algebraic data types
23	Florian Luisier, Thierry Blu	SURE-LET Multichannel Image Denoising: Interscale Orthonormal Wavelet Thresholding.	IEEE Trans. Image Process.	2008	DBLP DOI BibTeX RDF
23	Henning Makholm, J. B. Wells	Type inference, principal typings, and let-polymorphism for first-class mixin modules.	ICFP	2005	DBLP DOI BibTeX RDF	mixin modules, record concatenation, row unification, type systems, polymorphism
23	Simon L. Peyton Jones, Will Partain, André L. M. Santos	Let-floating: Moving Bindings to Give Faster Programs.	ICFP	1996	DBLP DOI BibTeX RDF
19	Edward P. F. Chan, Yaya Yang	Shortest Path Tree Computation in Dynamic Graphs.	IEEE Trans. Computers	2009	DBLP DOI BibTeX RDF
19	Mona B. Musa	On Some Double Circulant Binary Extended Quadratic Residue Codes.	IEEE Trans. Inf. Theory	2008	DBLP DOI BibTeX RDF
19	Jean-Claude Bermond, Michel Cosnard	Minimum number of wavelengths equals load in a DAG without internal cycle.	IPDPS	2007	DBLP DOI BibTeX RDF
19	Jiansheng Cai, Guizhen Liu, Jianfeng Hou	Binding Number and Connected ( g , f + 1)-Factors in Graphs.	International Conference on Computational Science (3)	2007	DBLP DOI BibTeX RDF
19	Dalia Krieger	On Critical Exponents in Fixed Points of Non-erasing Morphisms.	Developments in Language Theory	2006	DBLP DOI BibTeX RDF
19	Noga Alon, Raphael Yuster	On a Hypergraph Matching Problem.	Graphs Comb.	2005	DBLP DOI BibTeX RDF
19	Philip D. Welch	On unfoldable cardinals, omega-closed cardinals, and the beginning of the inner model hierarchy.	Arch. Math. Log.	2004	DBLP DOI BibTeX RDF	Large cardinals, Inner models, Descriptive set theory, Constructibility
19	Radim Belohlávek, Tatána Funioková, Vilém Vychodil	Galois Connections with Truth Stressers: Foundations for Formal Concept Analysis of Object-Attribute Data with Fuzzy Attributes.	Fuzzy Days	2004	DBLP DOI BibTeX RDF
19	Alan Siegel	An Isoperimetric Theorem in Plane Geometry.	Discret. Comput. Geom.	2003	DBLP DOI BibTeX RDF
19	Ruy Luiz Milidiú, Eduardo Sany Laber	Bounding the Inefficiency of Length-Restricted Prefix Codes.	Algorithmica	2001	DBLP DOI BibTeX RDF	Huffman trees, Approximative algorithm, Compression, Redundancy, Prefix codes
19	Daniel Panario, L. Bruce Richmond	Smallest Components in Decomposable Structures: Exp-Log Class.	Algorithmica	2001	DBLP DOI BibTeX RDF	Huffman trees, Approximative algorithm, Compression, Redundancy, Prefix codes
19	Raphael Yuster	Large Monotone Paths in Graphs with Bounded Degree.	Graphs Comb.	2001	DBLP DOI BibTeX RDF
19	P. Morales, F. García Mazarío, Pedro Jiménez Guerra	First Alexandroff Decomposition Theorem for Topological Lattice Group Valued Measures.	Order	2000	DBLP DOI BibTeX RDF	paving, topological lattice group, K-inner regular measure, Alexandroff space, A-compactness, Wallman extension, F-mooth measure, Boolean algebra
19	Eijiro Sumii, Naoki Kobayashi 0001	Online-and-Offline Partial Evaluation: A Mixed Approach (Extended Abstract).	PEPM	2000	DBLP DOI BibTeX RDF
19	Youxin Gao, Martin D. F. Wong	Optimal shape function for a bidirectional wire under Elmore delay model.	IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.	1999	DBLP DOI BibTeX RDF
19	András Antos, Luc Devroye, László Györfi	Lower Bounds for Bayes Error Estimation.	IEEE Trans. Pattern Anal. Mach. Intell.	1999	DBLP DOI BibTeX RDF	lower bounds, Discrimination, statistical pattern recognition, rates of convergence, nonparametric estimation, Bayes error
19	Wojciech Banaszczyk, Stanislaw J. Szarek	Lattice Coverings and Gaussian Measures of n-Dimensional Convex Bodies.	Discret. Comput. Geom.	1997	DBLP DOI BibTeX RDF
19	Youxin Gao, D. F. Wong 0001	Optimal shape function for a bi-directional wire under Elmore delay model.	ICCAD	1997	DBLP DOI BibTeX RDF	Bi-directional wire, Optimal shape, Elmore Delay
19	Juan Sabia, Pablo Solernó	Bounds for traces in complete intersections and degrees in the Nullstellensatz.	Appl. Algebra Eng. Commun. Comput.	1995	DBLP DOI BibTeX RDF	Complete intersection polynomial ideals, Bezout’s inequality, Effective Nullstellensatz, Bertini’s theorem, Trace theory
19	Alberto Bertoni, Paola Campadelli, Anna Morpurgo, Sandra Panizza	Polynomial Iniform Convergence and Polynomial-Sample Learnability.	COLT	1992	DBLP DOI BibTeX RDF
19	Yang Cai 0003, D. F. Wong 0001	Optimal via-shifting in channel compaction.	EURO-DAC	1990	DBLP DOI BibTeX RDF
19	Diana Patterson	The myth and realities of C.A.S.E. for documentation.	SIGDOC	1989	DBLP DOI BibTeX RDF
19	Michael Luby, Charles Rackoff	How to Construct Pseudo-Random Permutations from Pseudo-Random Functions (Abstract).	CRYPTO	1985	DBLP DOI BibTeX RDF
19	Kathryn L. Schenk, James R. Pinkert	An Algorithm for Servicing Multi-Relational Queries.	SIGMOD Conference	1977	DBLP DOI BibTeX RDF
19	George E. Collins	Subresultants and Reduced Polynomial Remainder Sequences.	J. ACM	1967	DBLP DOI BibTeX RDF
19	George C. Caldwell	A Note on the Downhill Method.	J. ACM	1959	DBLP DOI BibTeX RDF
19	Pentti Laasonen	On the Truncation Error of Discrete Approximations to the Solutions of Dirichlet Problems in a Domain with Corners.	J. ACM	1958	DBLP DOI BibTeX RDF
18	Saskia Delpretti, Florian Luisier, Sathish Ramani, Thierry Blu, Michael Unser	Multiframe sure-let denoising of timelapse fluorescence microscopy images.	ISBI	2008	DBLP DOI BibTeX RDF
18	Florian Luisier, Thierry Blu	SURE-LET multichannel image denoising: undecimated wavelet thresholding.	ICASSP	2008	DBLP DOI BibTeX RDF
18	Alexey Karpov 0001, Andrey Ronzhin, Anastasia Leontyeva	A Semi-automatic Wizard of Oz Technique for Let'sFly Spoken Dialogue System.	TSD	2008	DBLP DOI BibTeX RDF	automatic speech recognition, call-centers, Spoken dialogue systems, spoken language understanding, Wizard of Oz study
18	Matthias Brantner, Carl-Christian Kanne, Guido Moerkotte	Let a Single FLWOR Bloom.	XSym	2007	DBLP DOI BibTeX RDF
18	Yi Zhang 0012, Lidong Bing, Yexin Wang, Yan Zhang 0004	LET: Towards More Precise Clustering of Search Results.	FSKD (2)	2007	DBLP DOI BibTeX RDF
18	Michael Norrish, Konrad Slind	Proof Pearl: Using Combinators to Manipulate let-Expressions in Proof.	TPHOLs	2005	DBLP DOI BibTeX RDF
18	Norio Baba, Y. Takagawara	Utilization of GAs in order to let a player on the computer side have enough intelligence.	KES	1999	DBLP DOI BibTeX RDF
18	Oukseh Lee, Kwangkeun Yi	Proofs about a Folklore Let-Polymorphic Type Inference Algorithm.	ACM Trans. Program. Lang. Syst.	1998	DBLP DOI BibTeX RDF	type inference algorithm, type error
18	Chuck C. Liang	Let-Polymorphism and Eager Type Schemes.	TAPSOFT	1997	DBLP DOI BibTeX RDF
15	Kunal Agrawal, Charles E. Leiserson, Jim Sukha	Helper locks for fork-join parallel programming.	PPoPP	2010	DBLP DOI BibTeX RDF	dynamic multithreading, helper lock, parallel region, scheduling, work stealing, nested parallelism, cilk
15	Gábor Czédli, Miklós Maróti, E. Tamás Schmidt	On the Scope of Averaging for Frankl's Conjecture.	Order	2009	DBLP DOI BibTeX RDF	Union-closed sets, Frankl’s conjecture, Lattice
15	Yu-Ru Liu, Craig V. Spencer	A generalization of Meshulam's theorem on subsets of finite abelian groups with no 3-term arithmetic progression.	Des. Codes Cryptogr.	2009	DBLP DOI BibTeX RDF	Mathematics Subject Classifications (2000) 11B25, 20D60, 11T24
15	Yuval Peres	The unreasonable effectiveness of martingales.	SODA	2009	DBLP DOI BibTeX RDF
15	Christos Boutsidis, Michael W. Mahoney, Petros Drineas	An improved approximation algorithm for the column subset selection problem.	SODA	2009	DBLP DOI BibTeX RDF
15	Kei Uchizawa, Takao Nishizeki, Eiji Takimoto	Size and Energy of Threshold Circuits Computing Mod Functions.	MFCS	2009	DBLP DOI BibTeX RDF
15	Matthew J. Katz, Gila Morgenstern	A Scheme for Computing Minimum Covers within Simple Regions.	WADS	2009	DBLP DOI BibTeX RDF
15	Sergey Kitaev, Steve Seif	Word Problem of the Perkins Semigroup via Directed Acyclic Graphs.	Order	2008	DBLP DOI BibTeX RDF	Perkins semigroup, Free semigroup, Computational complexity -, Directed acyclic graph, Poset, Partially order set, Word problem
15	Daqing Wan	Modular Counting of Rational Points over Finite Fields.	Found. Comput. Math.	2008	DBLP DOI BibTeX RDF
15	Maria Chudnovsky, Paul D. Seymour, Blair D. Sullivan	Cycles in dense digraphs.	Comb.	2008	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000) 05C20, 05C35, 05C38
15	Michael Langberg	Oblivious Communication Channels and Their Capacity.	IEEE Trans. Inf. Theory	2008	DBLP DOI BibTeX RDF
15	Remke Kloosterman	Point Counting on Singular Hypersurfaces.	ANTS	2008	DBLP DOI BibTeX RDF
15	Pankaj K. Agarwal, Danny Z. Chen, Shashidhara K. Ganjugunte, Ewa Misiolek, Micha Sharir, Kai Tang 0001	Stabbing Convex Polygons with a Segment or a Polygon.	ESA	2008	DBLP DOI BibTeX RDF
15	Erik Gudmundson, Petre Stoica	On denoising via penalized least-squares rules.	ICASSP	2008	DBLP DOI BibTeX RDF
15	Benjamin Rossman	On the constant-depth complexity of k-clique.	STOC	2008	DBLP DOI BibTeX RDF	ac0, bounded variable hierarchy, k-clique, first-order logic, circuit complexity, constant-depth circuits
15	B. V. Subramanya Bharadwaj, L. Sunil Chandran, Anita Das 0001	Isoperimetric Problem and Meta-Fibonacci Sequences.	COCOON	2008	DBLP DOI BibTeX RDF
15	Ognyan Kounchev, Hermann Render	Convergence of polyharmonic splines on semi-regular grids \mathbbZ× a \mathbbZn for a®0.	Numer. Algorithms	2007	DBLP DOI BibTeX RDF	Mathematics Subject Classifications (2000) Primary 41A05, Secondary 41A15, 65D10
15	Carlos M. Nicolás	The Empty Hexagon Theorem.	Discret. Comput. Geom.	2007	DBLP DOI BibTeX RDF
15	Chung-Haw Chang, Chao-Ming Sun, Hua-Min Huang, Lih-Hsing Hsu	On the equitable k *-laceability of hypercubes.	J. Comb. Optim.	2007	DBLP DOI BibTeX RDF	Hamiltonian laceable, Hypercube, Container, Hamiltonian
15	Liam Roditty, Michael Segal 0001	On bounded leg shortest paths problems.	SODA	2007	DBLP BibTeX RDF
15	Asaf Shapira, Raphael Yuster, Uri Zwick	All-pairs bottleneck paths in vertex weighted graphs.	SODA	2007	DBLP BibTeX RDF
15	Francisco Javier López-Fraguas, Juan Rodríguez-Hortalá, Jaime Sánchez-Hernández	A simple rewrite notion for call-time choice semantics.	PPDP	2007	DBLP DOI BibTeX RDF	constructor-based rewriting logic, local bindings, non-determinism calltime choice semantics, sharing, term rewriting systems, functional-logic programming
15	Izumi Miyamoto	A computation of some multiply homogeneous superschemes from transitive permutation groups.	ISSAC	2007	DBLP DOI BibTeX RDF
15	G. Zeibig	Coherence for Product Monoids and their Actions.	Appl. Categorical Struct.	2006	DBLP DOI BibTeX RDF	AMS 2000 Mathematics Subject Classification Primary 18D35, Secondary 18D15, 19D23, 18C15
15	Tero Harju, Dirk Nowotka	Periods in Extensions of Words.	Acta Informatica	2006	DBLP DOI BibTeX RDF
15	Yonatan Bilu, Nathan Linial	Lifts, Discrepancy and Nearly Optimal Spectral Gap*.	Comb.	2006	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 05C22, 05C35, 05C80, 05C50
15	Nathan Linial, Roy Meshulam	Homological Connectivity Of Random 2-Complexes.	Comb.	2006	DBLP DOI BibTeX RDF	Mathematics Subject Classification (2000): 55U10, 05C80